Výsledky vyhledávání - Nonnumerical Algorithms and Problems—computations on discrete structures General Terms Algorithms~

1. STATIC OPTIMIZATION OF BARRIER SYNCHRONIZATION

Autoři: Alain Darte Robert Schreiber The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Alain Darte Robert Schreiber The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.hpl.hp.com/personal/Robert_Schreiber/papers/2004 Barrier Minimization in Loop Nests/ppopp/Final Version/ppopp barriers.pdf.

Témata: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Computations on discrete structures General Terms Algorithms, Languages, Theory Keywords Barrier synchronization, circular arc graph, nested circular interval graph, SPMD code, nested loops

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9098; http://www.hpl.hp.com/personal/Robert_Schreiber/papers/2004 Barrier Minimization in Loop Nests/ppopp/Final Version/ppopp barriers.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9098
http://www.hpl.hp.com/personal/Robert_Schreiber/papers/2004 Barrier Minimization in Loop Nests/ppopp/Final Version/ppopp barriers.pdf

Akamai Technologies

Autoři: Pankaj K. Agarwal Thomas Mølhave Jiangwei Pan a další

Přispěvatelé: Pankaj K. Agarwal Thomas Mølhave Jiangwei Pan a další

Zdroj: http://www.cs.duke.edu/~pankaj/publications/papers/traj.pdf.

Témata: Categories and Subject Descriptors H.2.8 [Database Management, Database Applications—data mining, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures General Terms Algorithms, Experimentation, Performance

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.8262; http://www.cs.duke.edu/~pankaj/publications/papers/traj.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.8262
http://www.cs.duke.edu/~pankaj/publications/papers/traj.pdf

B.David Saunders#Department of Computer and

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

Zdroj: http://www.math.umd.edu/~jda/preprints/issac05_asw.ps.

Témata: Categories and Subject Descriptors G.4 [Mathematical Software, Algorithm Design and Analysis, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures General Terms Algorithms, Performance Keywords matrix signature, symmetric matrix, lie group

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.82.559; http://www.math.umd.edu/~jda/preprints/issac05_asw.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.82.559
http://www.math.umd.edu/~jda/preprints/issac05_asw.ps

Algorithms for near-rings of non-linear transformations

Autoři: Franz Binder Erhard Aichinger Jürgen Ecker a další

Přispěvatelé: Franz Binder Erhard Aichinger Jürgen Ecker a další

Zdroj: http://www.algebra.uni-linz.ac.at/~xbx/pub/issac2000/algos4.ps.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--computations on discrete structures, I.1.2 [Symbolic and Algebraic Manipulation, Algorithms--algebraic algorithms, G.2 [Mathematics and Computing, Discrete Mathematics General Terms Algorithms Keywords Near-rings, Non-linear transformations, Groups

Popis souboru: application/postscript

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.5164
http://www.algebra.uni-linz.ac.at/~xbx/pub/issac2000/algos4.ps

All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time

Autoři: Virginia Vassilevska, Ryan Williams, Raphael Yuster The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Virginia Vassilevska, Ryan Williams, Raphael Yuster The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.cmu.edu/~virgi/apbp-stoc.pdf.

Témata: Nonnumerical Algorithms and Problems–Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords bottleneck path, maximum capacity path, matrix multiplication, sub-cubic time

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.8059
http://www.cs.cmu.edu/~virgi/apbp-stoc.pdf

Towards Fast Decentralized Construction of Locality-Aware Overlay Networks

Autoři: Aleksandrs Slivkins The Pennsylvania State University CiteSeerX Archives

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

Zdroj: http://research.microsoft.com/users/slivkins/podc07_full.pdf.

Témata: ACM Categories and Subject Descriptors. E.1 [Data Structures, Distributed data structures, Graphs and networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures, Routing and layout, G.2 [Discrete Mathematics, G.2.1 Combinatorics – Combinatorial algorithms, G.2.2 Graph Theory – Graph algorithms, Graph labeling, Network problems. C.2.2 [Computer- Communication Networks, Network Protocols – Routing protocols. ACM General Terms. Algorithms, Performance, Theory Keywords. Routing schemes, multi-cast trees, distance labeling, triangulation, grid dimension, growthconstrained metrics, locality-awareness

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460; http://research.microsoft.com/users/slivkins/podc07_full.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460
http://research.microsoft.com/users/slivkins/podc07_full.pdf

Beating the Spread: Time-Optimal Point Meshing (Extended Abstract)

Autoři: Gary L. Miller Todd Phillips Donald R. Sheehy a další

Přispěvatelé: Gary L. Miller Todd Phillips Donald R. Sheehy a další

Zdroj: http://www.cs.cmu.edu/~glmiller/Publications/Papers/scg146-miller.pdf.

Témata: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, Geometrical problems and computations General Terms Algorithms, Theory Keywords mesh generation, sparse Voronoi refinement, range spaces, epsilon nets, spread

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.2460
http://www.cs.cmu.edu/~glmiller/Publications/Papers/scg146-miller.pdf

X.: Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change

Autoři: Per Kristian Lehre Xin Yao The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Per Kristian Lehre Xin Yao The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.bham.ac.uk/%7Exin/papers/RohlfshagenLehreYao09GECCO.pdf.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.3[Probability and Statistics, Probabilistic Algorithms General Terms Algorithms, Theory Keywords Evolutionary algorithms, dynamic evolutionary computation, runtime analysis

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.911; http://www.cs.bham.ac.uk/%7Exin/papers/RohlfshagenLehreYao09GECCO.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.911
http://www.cs.bham.ac.uk/%7Exin/papers/RohlfshagenLehreYao09GECCO.pdf

Dynamic Evolutionary Optimisation: An Analysis of Frequency and Magnitude of Change

Autoři: Philipp Rohlfshagen Per Kristian Lehre Xin Yao a další

Přispěvatelé: Philipp Rohlfshagen Per Kristian Lehre Xin Yao a další

Zdroj: http://www.cs.bham.ac.uk/~pkl/publications/rly2009dynamic.pdf.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.3[Probability and Statistics, Probabilistic Algorithms General Terms Algorithms, Theory Keywords Evolutionary algorithms, dynamic evolutionary computation, runtime analysis

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6550; http://www.cs.bham.ac.uk/~pkl/publications/rly2009dynamic.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6550
http://www.cs.bham.ac.uk/~pkl/publications/rly2009dynamic.pdf

T.: Distributed approximation of capacitated dominating sets

Autoři: Fabian Kuhn Thomas Moscibroda The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Fabian Kuhn Thomas Moscibroda The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.pdf.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords capacities, dominating sets, distributed approximation

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.9798; http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.9798
http://www.cadmo.ethz.ch/as/people/alumni/fkuhn/pubs/spaa07b.pdf

Tight Bounds for Distributed Selection

Autoři: Fabian Kuhn Thomas Locher Roger Wattenhofer a další

Přispěvatelé: Fabian Kuhn Thomas Locher Roger Wattenhofer a další

Zdroj: http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory—graph algorithms, Graph Theory—network problems General Terms Algorithms, Theory Keywords Data Aggregation, Distributed Algorithms, In-Network Aggregation, Median, Time Complexity, Sensor Networks

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6192; http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.6192
http://www.tik.ee.ethz.ch/file/5a15f565006b60eac7b39b7e61885879/spaa07.pdf

[Untitled]

Autoři: Peter G. Jeavonscomputing Laboratory The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Peter G. Jeavonscomputing Laboratory The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps.

Témata: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--computations on discrete structures, I.2.4 [Artificial Intelligence, Knowledge Representation Formalisms and Methods--relation systems, G.2.1 [Discrete Mathematics, Combinatorics--combinatorial algorithms General Terms Algorithms, Theory Keywords constraint satisfaction problem, constraint language, complexity, tractability, NP-completeness, algebraic invariance property, relational clone

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1875; http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1875
http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps

Subcubic algorithms for recursive state machines

Autoři: Swarat Chaudhuri The Pennsylvania State University CiteSeerX Archives

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

Zdroj: http://www.cse.psu.edu/~swarat/pubs/popl08.pdf.

Témata: General Terms Algorithms, Theory, Verification Keywords Recursive state machines, pushdown systems, CFLreachability, context-free languages, interprocedural analysis, transitive closure, cubic bottleneck

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.9128; http://www.cse.psu.edu/~swarat/pubs/popl08.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.9128
http://www.cse.psu.edu/~swarat/pubs/popl08.pdf

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

Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter, and Matchings.

Autoři: CYGAN, MAREK GABOW, HAROLD N. SANKOWSKI, PIOTR

Zdroj: Journal of the ACM; Aug2015, Vol. 62 Issue 4, p1-30, 30p

Témata: MATRIX multiplications, MATRICES (Mathematics), MATHEMATICS theorems, THEORY, ALGORITHMS

Improved Algorithms for Constructing Consensus Trees.

Autoři: JANSSON, JESPER CHUANQI SHEN WING-KIN SUNG

Zdroj: Journal of the ACM; Jun2016, Vol. 63 Issue 3, p1-24, 24p

Témata: MACHINE learning, ALGORITHMS, GREEDY algorithms, HEURISTIC algorithms, BOOTSTRAP aggregation (Algorithms)

A Master Theorem for Discrete Divide and Conquer Recurrences.

Autoři: DRMOTA, MICHAEL SZPANKOWSKI, WOJCIECH

Zdroj: Journal of the ACM; Jun2013, Vol. 60 Issue 3, p1-49, 49p

Témata: TAUBERIAN theorems, ALGORITHM research, DIRICHLET principle, CENTRAL limit theorem, EQUATIONS, COMPUTER science

Approximate Distance Oracles.

Autoři: Thorup, Mikkel Zwick, Uri

Zdroj: Journal of the ACM; Jan2005, Vol. 52 Issue 1, p1-24, 24p, 4 Diagrams, 2 Charts

Témata: ALGORITHMS, DATA structures, DATABASES, ELECTRONIC file management, APPROXIMATION theory

On the Sum-of-Squares Algorithm for Bin Packing.

Autoři: Csirik, Janos Johnson, David S. Kenyon, Claire a další

Zdroj: Journal of the ACM; Jan2006, Vol. 53 Issue 1, p1-65, 65p

Témata: ALGORITHMS, INTEGRALS, LINEAR programming, POLYNOMIALS, ONLINE algorithms

A New Approach to Dynamic All Pairs Shortest Paths.

Autoři: Demetrescu, Camil Italiano, Giuseppe F.

Zdroj: Journal of the ACM; Nov2004, Vol. 51 Issue 6, p968-992, 25p, 9 Diagrams, 3 Charts

Témata: GRAPH theory, GRAPHIC methods, ALGEBRA, COMBINATORICS, ALGORITHMS, FOUNDATIONS of arithmetic