Výsledky vyhľadávania - analysis of algorithms and problems complexity—nonnumerical algorithms and problems general terms~

Online Auctions and Generalized Secretary Problems. SIGecom Exchange 7

Autori: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

Prispievatelia: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: graph algorithms, computational geometry, matrix multiplication

Popis súboru: 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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: routing, mobile network, dynamic graphs

Popis súboru: application/postscript

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

Dostupnosť: 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 . . .

Autori: Anupam Gupta Amit Kumar Martin Pál a ďalší

Prispievatelia: Anupam Gupta Amit Kumar Martin Pál a ďalší

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

Autori: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

Prispievatelia: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

Autori: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

Prispievatelia: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

Autori: Niv Buchbinder Kamal Jain Mohit Singh a ďalší

Prispievatelia: Niv Buchbinder Kamal Jain Mohit Singh a ďalší

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

Predmety: 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 súboru: 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

Dostupnosť: 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

Autori: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a ďalší

Prispievatelia: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a ďalší

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

Predmety: 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 súboru: 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

Dostupnosť: 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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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]

Autori: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

Prispievatelia: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

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

Predmety: 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 súboru: 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

Dostupnosť: 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

Autori: Fabian Kuhn Thomas Locher Stefan Schmid a ďalší

Prispievatelia: Fabian Kuhn Thomas Locher Stefan Schmid a ďalší

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

Predmety: 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 súboru: 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

Dostupnosť: 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.

Autori: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN

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

Predmety: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory

Cost-Oblivious Storage Reallocation.

Autori: BENDER, MICHAEL A. FARACH-COlTON, MARTúN FEKETE, SÁNDOR P. a ďalší

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

Predmety: MATHEMATICAL bounds, COST functions, DATABASES, LOGARITHMIC functions, VIRTUAL storage (Computer science)

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

Autori: SARKAR, RIK ZHU, XIANJIN GAO, JIE

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

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

Continuous Sampling from Distributed Streams.

Autori: CORMODE, GRAHAM MUTHUKRISHNAN, S. YI, KE a ďalší

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

Predmety: 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.

Autori: Navarro, Gonzalo

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

Predmety: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

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

Autori: Jansen, Klaus Zhang, Hu

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

Predmety: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

On Approximating Multicriteria TSP.

Autori: Manthey, Bodo

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

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

Local Ratio: A Unified Framework for Approximation Algorithms.

Autori: Bar-Yehuda, Reuven Bendel, Keren Freund, Ari a ďalší

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

Predmety: ALGORITHMS, APPROXIMATION theory, PRODUCTION scheduling, MATHEMATICAL optimization, LINEAR programming, OPERATIONS research

Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets.

Autori: Raman, Venkatesh Saurabh, Saket Subramanian, C. R.

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

Predmety: ACYCLIC model, HOMOLOGICAL algebra, ALGEBRAIC topology, ALGORITHMS, COMPUTATIONAL mathematics, MATHEMATICAL programming