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

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

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

Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.

Autoři: CHATTERJEE, KRISHNENDU HENZINGER, MONIKA

Zdroj: Journal of the ACM; May2014, Vol. 61 Issue 3, p15:1-15:40, 40p

Témata: VIDEO games, GRAPH algorithms, MARKOV processes, GRAPH theory, MATHEMATICAL decomposition

Lower Bounds for Local Approximation.

Autoři: GÖÖS, MIKA HIRVONEN, JUHO SUOMELA, JUKKA

Zdroj: Journal of the ACM; Oct2013, Vol. 60 Issue 5, p1-23, 23p

Témata: APPROXIMATION theory, FUNCTIONAL analysis, MATHEMATICAL functions, ALGORITHMS, COMPUTER network resources

Tight Bounds for Clock Synchronization.

Autoři: LENZEN, CHRISTOPH LOCHER, THOMAS WATTENHOFER, ROGER

Zdroj: Journal of the ACM; Jan2010, Vol. 57 Issue 2, p8-8:42, 42p

Témata: SYNCHRONIZATION, TIME measurements, FRAME synchronizers, CLOCKS & watches, DISTRIBUTED computing, ALGORITHMS

Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings.

Autoři: Dinitz, Yefim Moran, Shlomo Rajsbaum, Sergio

Zdroj: Journal of the ACM; Feb2008, Vol. 55 Issue 1, p1-28, 28p, 4 Diagrams

Témata: COMPUTER networks, ELECTRONIC data processing, DATA transmission systems, BIT rate, ALGORITHMS, COMPUTER programming

The Generalized Two-Server Problem.

Autoři: Sitters, René A. Stougie, Leen

Zdroj: Journal of the ACM; May2006, Vol. 53 Issue 3, p437-458, 22p

Témata: CLIENT/SERVER computing, ELECTRONIC data processing, INFORMATION processing, METRIC projections, ALGORITHMS

Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT.

Autoři: GOLOVNEV, ALEXANDER KULIKOV, ALEXANDER S. MIHAJLIN, IVAN

Zdroj: ACM Transactions on Algorithms; Apr2016, Vol. 12 Issue 3, p1-17, 17p

Témata: POLYNOMIAL time algorithms, FAST Fourier transforms, INFANTS, GRAPH coloring, GEOMETRIC vertices, COEFFICIENTS (Statistics)

The Hardness of Data Packing.

Autoři: Lavaee, Rahman

Zdroj: ACM / SIGPLAN Notices; Jan2016, Vol. 51 Issue 1, p232-242, 11p

Using minimal minterms to represent programmability.

Autoři: Keutzer, K. Weber, S.J.

Zdroj: 2005 Third IEEE/ACM/IFIP International Conference on Hardware/Software Codesign & System Synthesis (CODES+ISSS'05); 2005, p63-68, 6p

Approximating the Diameter of Planar Graphs in Near Linear Time.

Autoři: WEIMANN, OREN YUSTER, RAPHAEL

Zdroj: ACM Transactions on Algorithms; Nov2015, Vol. 12 Issue 1, p12:2-12:13, 13p

Témata: APPROXIMATION theory, TIME series analysis, LINEAR time invariant systems, PLANAR graphs, GRAPH theory

Interval Deletion Is Fixed-Parameter Tractable.

Autoři: CAO, YIXIN MARX, DÁNIEL

Zdroj: ACM Transactions on Algorithms; Jan2015, Vol. 11 Issue 3, p21:1-21:35, 35p

Témata: INTERVAL analysis, GRAPH theory, PARAMETERIZATION, SET theory, MATHEMATICAL decomposition, ALGORITHMS

Approximation Algorithms for Secondary Spectrum Auctions.

Autoři: HOEFER, MARTIN KESSELHEIM, THOMAS VÖCKING, BERTHOLD

Zdroj: ACM Transactions on Internet Technology; Oct2014, Vol. 14 Issue 2/3, p16:1-16:24, 24p

Témata: APPROXIMATION algorithms, SPECTRUM auctions, COMBINATORIAL optimization, WIRELESS sensor nodes, GRAPH theory

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm.

Autoři: MAKARYCHEV, KONSTANTIN MANOKARAN, RAJSEKAR SVIRIDENKO, MAXIM

Zdroj: ACM Transactions on Algorithms; Jul2014, Vol. 10 Issue 4, p1-18, 18p

Témata: QUADRATIC assignment problem, APPROXIMATION algorithms, ISOMORPHISM (Mathematics), GRAPH theory, LINEAR programming, ALGORITHMS

A Logarithmic Approximation for Unsplittable Flow on Line Graphs.

Autoři: BANSAL, NIKHIL FRIGGSTAD, ZACHARY KHANDEKAR, ROHIT a další

Zdroj: ACM Transactions on Algorithms; Jan2014, Vol. 10 Issue 1, p1-15, 15p

Témata: LOGARITHMS, FLUID dynamics, GRAPH theory, POLYNOMIAL time algorithms, BANDWIDTHS, DYNAMIC programming

Bin Packing via Discrepancy of Permutations.

Autoři: EISENBRAND, FRIEDRICH PÁLVÖLGYI, DÖMÖTÖR ROTHVOß, THOMAS

Zdroj: ACM Transactions on Algorithms; Jun2013, Vol. 9 Issue 3, p1-15, 15p

Témata: BIN packing problem, DISCREPANCY theorem, PERMUTATIONS, ALGORITHMS, LINEAR programming, MATHEMATICAL bounds, MATHEMATICAL proofs

Survey of Local Algorithms.

Autoři: SUOMELA, JUKKA

Zdroj: ACM Computing Surveys; Feb2013, Vol. 45 Issue 2, p24-24:40, 40p, 15 Diagrams, 4 Charts

Témata: DISTRIBUTED algorithms, COMPUTER networks, FAULT-tolerant computing, FACE-to-face communication, DISTRIBUTED computing, SCALABILITY

Succinct Ordinal Trees Based on Tree Covering.

Autoři: He, Meng Ian Munro, J. Satti, Srinivasa Rao

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 4, p1-32, 32p

Témata: TREE graphs, INFORMATION theory, DATA analysis, SET theory, REPRESENTATIONS of graphs, MATHEMATICAL sequences, DATA structures

Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves.

Autoři: Binkele-Raible, Daniel Fernau, Henning Fomin, Fedor V. a další

Zdroj: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 4, p1-19, 19p

Témata: KERNEL (Mathematics), TREE graphs, SPANNING trees, DIRECTED graphs, ALGORITHMS, MATHEMATICAL bounds, POLYNOMIALS