Výsledky vyhľadávania - "Analysis of Algorithms and Problem Complexity General Terms"

Experimental Evaluation of an Adiabatic Quantum System for Combinatorial Optimization

Autori: Catherine C. McGeoch Cong Wang The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Catherine C. McGeoch Cong Wang The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.amherst.edu/ccm/cf14-mcgeoch.pdf.

Predmety: C.4 [Computer Systems Organization, Performance of Systems, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity General Terms Algorithms, Experimentation, Performance Keywords Adiabatic Quantum Computing, Quantum Annealing, D- Wave, Heuristics

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.859
http://www.cs.amherst.edu/ccm/cf14-mcgeoch.pdf

Time-optimal information exchange on multiple channels

Autori: Stephan Holzer Yvonne-anne Pignolet Jasmin Smula a ďalší

Prispievatelia: Stephan Holzer Yvonne-anne Pignolet Jasmin Smula a ďalší

Zdroj: http://www.tik.ee.ethz.ch/file/6b2d72c6496d597a2f0c4210f34a3f4a/fomc15-holzer_231.pdf.

Predmety: F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity General Terms Algorithms, Theory

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7285
http://www.tik.ee.ethz.ch/file/6b2d72c6496d597a2f0c4210f34a3f4a/fomc15-holzer_231.pdf

Don’t be greedy when calculating hypervolume contributions

Autori: Karl Bringmann Tobias Friedrich The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Karl Bringmann Tobias Friedrich The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.mpi-sb.mpg.de/~tfried/paper/2009FOGA_Hyp.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.6069
http://www.mpi-sb.mpg.de/~tfried/paper/2009FOGA_Hyp.pdf

Computing single source shortest paths using single-objective fitness functions

Autori: Surender Baswana Somenath Biswas Benjamin Doerr a ďalší

Prispievatelia: Surender Baswana Somenath Biswas Benjamin Doerr a ďalší

Zdroj: http://www.mpi-sb.mpg.de/~tfried/paper/2009FOGA_SSSP.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.3762
http://www.mpi-sb.mpg.de/~tfried/paper/2009FOGA_SSSP.pdf

Multiplicative approximations and the hypervolume indicator

Autori: Tobias Friedrich Christian Horoba Frank Neumann a ďalší

Prispievatelia: Tobias Friedrich Christian Horoba Frank Neumann a ďalší

Zdroj: http://www.mpi-sb.mpg.de/~tfried/paper/2009GECCO.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Approximation, evolutionary algorithms, hypervolume indicator

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.1393
http://www.mpi-sb.mpg.de/~tfried/paper/2009GECCO.pdf

Fixed-parameter evolutionary algorithms and the vertex cover problem

Autori: Stefan Kratsch Frank Neumann The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Stefan Kratsch Frank Neumann The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.mpi-inf.mpg.de/%7Eskratsch/papers/KratschN09_FixedParameterEvolutionaryAlgorithmsAndTheVertexCoverProblem.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Combinatorial Optimization, Evolutionary Algorithms, Multi-Objective Optimization, Runtime Analysis

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.4997
http://www.mpi-inf.mpg.de/%7Eskratsch/papers/KratschN09_FixedParameterEvolutionaryAlgorithmsAndTheVertexCoverProblem.pdf

Near-perfect load balancing by randomized rounding

Autori: Tobias Friedrich Thomas Sauerwald The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Tobias Friedrich Thomas Sauerwald The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.mpi-inf.mpg.de/~tfried/paper/2009STOC.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Algorithms, Theory

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.6893
http://www.mpi-inf.mpg.de/~tfried/paper/2009STOC.pdf

Computing Single Source Shortest Paths using Single-Objective Fitness Functions

Autori: Surender Baswana Somenath Biswas Benjamin Doerr a ďalší

Prispievatelia: Surender Baswana Somenath Biswas Benjamin Doerr a ďalší

Zdroj: http://www.mpi-sb.mpg.de/~fne/papers/SPFOGA09.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.8572
http://www.mpi-sb.mpg.de/~fne/papers/SPFOGA09.pdf

On the Size of Weights in Randomized Search Heuristics

Autori: Joachim Reichel Martin Skutella The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Joachim Reichel Martin Skutella The Pennsylvania State University CiteSeerX Archives

Zdroj: http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/25308.pdf.

Predmety: Categories and Subject Descriptors, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, evolutionary algorithms, randomized search heuristics

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.384.2589
http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/25308.pdf

Computing Minimum Cuts by Randomized Search Heuristics

Autori: Frank Neumann Joachim Reichel Martin Skutella a ďalší

Prispievatelia: Frank Neumann Joachim Reichel Martin Skutella a ďalší

Zdroj: http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/24208.pdf.

Predmety: Categories and Subject Descriptors, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, evolutionary algorithms, minimum s-t-cuts, multiobjective optimization, randomized

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.383.9902
http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/24208.pdf

Theoretical Analysis of Diversity Mechanisms for Global Exploration

Autori: Tobias Friedrich Pietro S. Oliveto Dirk Sudholt a ďalší

Prispievatelia: Tobias Friedrich Pietro S. Oliveto Dirk Sudholt a ďalší

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p945.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Diversity, runtime analysis, fitness sharing, deterministic crowding

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1693; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p945.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1693
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p945.pdf

Computing minimum cuts by randomized search heuristics

Autori: Frank Neumann Joachim Reichel Martin Skutella a ďalší

Prispievatelia: Frank Neumann Joachim Reichel Martin Skutella a ďalší

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p779.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, evolutionary algorithms, minimum s-t-cuts, multi-objective

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.8612; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p779.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.8612
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p779.pdf

Computing minimum cuts by randomized search heuristics

Autori: Frank Neumann Joachim Reichel Martin Skutella a ďalší

Prispievatelia: Frank Neumann Joachim Reichel Martin Skutella a ďalší

Zdroj: http://www.mpi-sb.mpg.de/~fne/papers/gecco_cuts.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, evolutionary algorithms, minimum s-t-cuts, multi-objective

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.3745
http://www.mpi-sb.mpg.de/~fne/papers/gecco_cuts.pdf

Approximating Covering Problems by Randomized Search Heuristics Using Multi-objective Models

Autori: Tobias Friedrich Jun He Nils Hebbinghaus a ďalší

Prispievatelia: Tobias Friedrich Jun He Nils Hebbinghaus a ďalší

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Combinatorial Optimization, Covering Problems, Multi-Objective Optimization, Runtime Analysis

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4360; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.4360
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p797.pdf

Rigorous analyses of simple diversity mechanisms

Autori: Tobias Friedrich Nils Hebbinghaus Frank Neumann a ďalší

Prispievatelia: Tobias Friedrich Nils Hebbinghaus Frank Neumann a ďalší

Zdroj: http://www.mpi-sb.mpg.de/~tfried/paper/2007GECCO_selection.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Diversity, Runtime Analysis, Selection Procedures

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.2494
http://www.mpi-sb.mpg.de/~tfried/paper/2007GECCO_selection.pdf

Rigorous analyses of simple diversity mechanisms

Autori: Tobias Friedrich Nils Hebbinghaus Frank Neumann a ďalší

Prispievatelia: Tobias Friedrich Nils Hebbinghaus Frank Neumann a ďalší

Zdroj: http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1219.pdf.

Predmety: Computation, Analysis of Algorithms and Problem Complexity General Terms, Theory, Algorithms, Performance Keywords, Diversity, Runtime Analysis, Selection Procedures

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1668; http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1219.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.1668
http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p1219.pdf

Space-Efficient Scheduling of Nested Parallelism

Autori: Girija J. Narlikar Guy E. Blelloch The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Girija J. Narlikar Guy E. Blelloch The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.cmu.edu/~scandal/papers/toplas.ps.gz.

Predmety: F.2.0 [Nonnumerical Algorithms and Problems, Analysis Of Algorithms and Problem Complexity General Terms, Algorithms, Languages, Performance Additional Key Words and Phrases, Dynamic scheduling, multithreading, nested parallelism, parallel language implementation, space efficiency

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7147; http://www.cs.cmu.edu/~scandal/papers/toplas.ps.gz

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.7147
http://www.cs.cmu.edu/~scandal/papers/toplas.ps.gz

Hardness of approximating the shortest vector problem in high Lp norms

Autori: Subhash Khot The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Subhash Khot The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.csie.nuk.edu.tw/~cychen/Lattices/Hardness of Approximating the Shortest Vector Problem in Lattices.pdf.

Predmety: Categories and Subject Descriptors, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity General Terms, Algorithms, Theory Additional Key Words and Phrases, Approximation algorithms, cryptography, hardness of approximation, lattices, shortest

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.7725; http://www.csie.nuk.edu.tw/~cychen/Lattices/Hardness of Approximating the Shortest Vector Problem in Lattices.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.7725
http://www.csie.nuk.edu.tw/~cychen/Lattices/Hardness of Approximating the Shortest Vector Problem in Lattices.pdf

Estimating Clustering Coefficients and Size of Social Networks via Random Walk

Autori: Stephen J. Hardiman The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Stephen J. Hardiman The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.technion.ac.il/%7Elirank/pubs/2015-ToW--Estimating-Clustering-Coefficients-and-Size-of-Social-Networks-via-Random-Walk.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Theory of Computing, Analysis of Algorithms and Problem Complexity General Terms, Algorithms Additional Key Words and Phrases, Estimation, Sampling, Clustering Coefficient, Social Network ACM Reference Format

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.192
http://www.cs.technion.ac.il/%7Elirank/pubs/2015-ToW--Estimating-Clustering-Coefficients-and-Size-of-Social-Networks-via-Random-Walk.pdf

Learning What’s Going on: Reconstructing Preferences and Priorities from Opaque Transactions

Autori: Avrim Blum The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Avrim Blum The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.cmu.edu/%7Ejamiemmt/papers/opaque-transactions.pdf.

Predmety: Categories and Subject Descriptors, F.2.0 [Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY General Terms, Mechanism Design, Learning Theory, Algorithms Additional Key Words and Phrases, mistake-bound learning ACM Reference Format, Avrim Blum, Yishay Mansour

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.7252
http://www.cs.cmu.edu/%7Ejamiemmt/papers/opaque-transactions.pdf