Výsledky vyhledávání - analysis of algorithms AND problems complexity—nonnumerical algorithms AND problems general terms~

Online Auctions and Generalized Secretary Problems. SIGecom Exchange 7

Autoři: Moshe Babaioff Nicole Immorlica David Kempe a další

Přispěvatelé: Moshe Babaioff Nicole Immorlica David Kempe a další

Zdroj: http://www-rcf.usc.edu/~dkempe/publications/secretarySIG.pdf.

Témata: Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Online Algorithms, Secretary Problems, Auctions, Knapsack, Matroids

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.7718

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.7718
http://www-rcf.usc.edu/~dkempe/publications/secretarySIG.pdf

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps.

Témata: graph algorithms, computational geometry, matrix multiplication

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779; http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779
http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://distcomp.ethz.ch/publications/dialm05a.ps.

Témata: routing, mobile network, dynamic graphs

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4183; http://distcomp.ethz.ch/publications/dialm05a.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4183
http://distcomp.ethz.ch/publications/dialm05a.ps

Approximation via Cost Sharing: Simpler and better . . .

Autoři: Anupam Gupta Amit Kumar Martin Pál a další

Přispěvatelé: Anupam Gupta Amit Kumar Martin Pál a další

Zdroj: http://theory.stanford.edu/~tim/papers/simple.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Approximation algorithms, cost sharing, network design, random sampling

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4736; http://theory.stanford.edu/~tim/papers/simple.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4736
http://theory.stanford.edu/~tim/papers/simple.pdf

Optimal-time adaptive strong renaming, with applications to counting

Autoři: Dan Alistarh James Aspnes Keren Censor-hillel a další

Přispěvatelé: Dan Alistarh James Aspnes Keren Censor-hillel a další

Zdroj: http://www.cs.yale.edu/homes/aspnes/papers/podc2011-tight-renaming-proceedings.pdf.

Témata: Categories and Subject Descriptors D.1.3 [Software, Programming Techniques—Concurrent programming, E.1 [Data, Data Structures, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms Alg, Theory Keywords distributed computing, shared memory, renaming, adaptive algorithms, sorting networks, lower bounds

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1084

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1084
http://www.cs.yale.edu/homes/aspnes/papers/podc2011-tight-renaming-proceedings.pdf

Online Auctions and Generalized Secretary Problems

Autoři: Moshe Babaioff Nicole Immorlica David Kempe a další

Přispěvatelé: Moshe Babaioff Nicole Immorlica David Kempe a další

Zdroj: http://www.ece.northwestern.edu/~nickle/pubs/sigecom-secretary.pdf.

Témata: Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Online Algorithms, Secretary Problems, Auctions, Knapsack, Matroids

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.619

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.619
http://www.ece.northwestern.edu/~nickle/pubs/sigecom-secretary.pdf

Secretary Problems and Incentives via Linear Programming

Autoři: Niv Buchbinder Kamal Jain Mohit Singh a další

Přispěvatelé: Niv Buchbinder Kamal Jain Mohit Singh a další

Zdroj: http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Design, Performance, Theory Additional Key Words and Phrases, Secretary Problem, Linear Program, Duality

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6536; http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6536
http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf

Minimizing Movement

Autoři: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a další

Přispěvatelé: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a další

Zdroj: http://cs.ucsb.edu/~suri/cs231/Rlist/movement.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Motion planning, pebble placement, graphs, Euclidean plane

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.8819; http://cs.ucsb.edu/~suri/cs231/Rlist/movement.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.8819
http://cs.ucsb.edu/~suri/cs231/Rlist/movement.pdf

A Validating XML Documents in the Streaming Model with External

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.liafa.jussieu.fr/~magniez/PAPIERS/km-tods.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of algorithms and problem complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.8316

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.8316
http://www.liafa.jussieu.fr/~magniez/PAPIERS/km-tods.pdf

Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract]

Autoři: Dan Alistarh James Aspnes Keren Censor-hillel a další

Přispěvatelé: Dan Alistarh James Aspnes Keren Censor-hillel a další

Zdroj: http://www.distcomp.ethz.ch/lectures/seminar/paper/Stephan/3.pdf.

Témata: Categories and Subject Descriptors D.1.3 [Software, Programming Techniques—Concurrent programming, E.1 [Data, Data Structures, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms Alg, Theory Keywords distributed computing, shared memory, renaming, adaptive algorithms, sorting networks, lower bounds

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.2800; http://www.distcomp.ethz.ch/lectures/seminar/paper/Stephan/3.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.2800
http://www.distcomp.ethz.ch/lectures/seminar/paper/Stephan/3.pdf

Distributed computation of the mode

Autoři: Fabian Kuhn Thomas Locher Stefan Schmid a další

Přispěvatelé: Fabian Kuhn Thomas Locher Stefan Schmid a další

Zdroj: http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf.

Témata: G.2.2 [Discrete Mathematics, Graph Theory graph algorithms, Graph Theory network problems General Terms Algorithms, Theory Keywords Aggregation, Distributed Algorithms, Mode, Most Frequent Element

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839; http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839
http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf

Polylogarithmic Concurrent Data Structures from Monotone Circuits.

Autoři: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN

Zdroj: Journal of the ACM; Feb2012, Vol. 59 Issue 1, p2-2:24, 24p

Témata: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory

Cost-Oblivious Storage Reallocation.

Autoři: BENDER, MICHAEL A. FARACH-COlTON, MARTúN FEKETE, SÁNDOR P. a další

Zdroj: ACM Transactions on Algorithms; Mar2017, Vol. 13 Issue 3, p1-20, 20p

Témata: MATHEMATICAL bounds, COST functions, DATABASES, LOGARITHMIC functions, VIRTUAL storage (Computer science)

Distributed and Compact Routing Using Spatial Distributions in Wireless Sensor Networks.

Autoři: SARKAR, RIK ZHU, XIANJIN GAO, JIE

Zdroj: ACM Transactions on Sensor Networks; May2013, Vol. 9 Issue 3, p32:1-32:20, 20p

Témata: WIRELESS sensor networks, SPATIAL distribution (Quantum optics), NETWORK routing protocols, ROUTING algorithms, GRAPH connectivity

Continuous Sampling from Distributed Streams.

Autoři: CORMODE, GRAHAM MUTHUKRISHNAN, S. YI, KE a další

Zdroj: Journal of the ACM; Apr2012, Vol. 59 Issue 2, p10.1-10.25, 25p

Témata: DATA flow computing, STATISTICAL sampling software, DISTRIBUTED databases, STREAMING technology, FLOW control (Data transmission systems), COMPUTATIONAL complexity, DATABASE management software

Computing MEMs and Relatives on Repetitive Text Collections.

Autoři: Navarro, Gonzalo

Zdroj: ACM Transactions on Algorithms; Jan2025, Vol. 21 Issue 1, p1-33, 33p

Témata: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints.

Autoři: Jansen, Klaus Zhang, Hu

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p416-434, 19p

Témata: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

On Approximating Multicriteria TSP.

Autoři: Manthey, Bodo

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 2, p17-17:18, 18p

Témata: APPROXIMATION algorithms, TRAVELING salesman problem, MATHEMATICAL symmetry, NUMERICAL analysis, PROBLEM solving, MAXIMA & minima, NUMBER theory

Local Ratio: A Unified Framework for Approximation Algorithms.

Autoři: Bar-Yehuda, Reuven Bendel, Keren Freund, Ari a další

Zdroj: ACM Computing Surveys; Dec2004, Vol. 36 Issue 4, p422-463, 42p

Témata: ALGORITHMS, APPROXIMATION theory, PRODUCTION scheduling, MATHEMATICAL optimization, LINEAR programming, OPERATIONS research

Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets.

Autoři: Raman, Venkatesh Saurabh, Saket Subramanian, C. R.

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p403-415, 13p

Témata: ACYCLIC model, HOMOLOGICAL algebra, ALGEBRAIC topology, ALGORITHMS, COMPUTATIONAL mathematics, MATHEMATICAL programming