Výsledky vyhledávání - Nonnumerical Algo- rithms and Problems—Computations on discrete structures

Ranking tournaments: local search and a new algorithm

Autoři: Tom Coleman Anthony Wirth The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Tom Coleman Anthony Wirth The Pennsylvania State University CiteSeerX Archives

Zdroj: http://tom.thesnail.org/assets/jea-08.pdf.

Témata: Categories and Subject Descriptors, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algo- rithms and Problems—Computations on discrete structures, Routing and layout, G.1.6 [Numer- ical Analysis, Optimization— General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Local Search, Feedback Arc Set, Approximation

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.697.5809
http://tom.thesnail.org/assets/jea-08.pdf

Precise interprocedural dataflow analysis with applications to constant propagation

Autoři: Thomas Reps Mooly Sagiv Susan Horwitz a další

Přispěvatelé: Thomas Reps Mooly Sagiv Susan Horwitz a další

Zdroj: http://repository.readscheme.org/ftp/papers/topps/D-215.pdf.

Témata: CR Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors − compilers, optimization, E.1 [Data Structures] − graphs, F.2.2 [Analysis of Algorithms and Problem Complexity, Complexity of Algorithms, Nonnumerical Algorithms and Problems − computations on discrete structures, G.2.2 [Discrete Mathematics, Graph Theory − graph algo- rithms General Terms, Algorithms, Theory Additional Key Words and Phrases, demand dataflow analysis, distributive dataflow framework, flow-sensitive side-effect analysis, function representation, graph reachability, interprocedural dataflow analysis, interprocedural program slicing, inter- procedurally realizable path, interprocedurally valid path, meet-over-all-valid-paths solution

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.7555
http://repository.readscheme.org/ftp/papers/topps/D-215.pdf

The expressibility of functions on the Boolean domain, with applications to Counting CSPs

Autoři: Andrei A. Bulatov Martin Dyer Leslie Ann Goldberg a další

Přispěvatelé: Andrei A. Bulatov Martin Dyer Leslie Ann Goldberg a další

Zdroj: http://www.cs.sfu.ca/~abulatov/papers/expressibility-acm.pdf.

Témata: Categories and Subject Descriptors, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness, Relations among complexity classes, F.2.2 [Analysis of Algo- rithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, F.4.1 [Mathematical Logic and Formal Languages

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.278
http://www.cs.sfu.ca/~abulatov/papers/expressibility-acm.pdf

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

Settling the Complexity of Computing Two-Player Nash Equilibria.

Autoři: XI CHEN XIAOTIE DENG SHANG-HUA TENG

Zdroj: Journal of the ACM; May2009, Vol. 56 Issue 3, p14:1-14:57, 57p, 2 Diagrams, 8 Charts

Témata: GAME theory, NASH equilibrium, DECISION making, DECISION theory, MATHEMATICAL economics, COMPUTATIONAL complexity, MACHINE theory

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Jul1982, Vol. 25 Issue 7, p487-492, 6p

Témata: SEQUENTIAL machine theory, REDUCED instruction set computers, MICROELECTRONICS, INTEGRATED circuits

Reviews & Products: COMMUNICATIONS of the ACM (Periodical)

Set Constraints with Projections.

Autoři: CHARATONIK, WITOLD PACHOLSKI, LESZEK

Zdroj: Journal of the ACM; Apr2010, Vol. 57 Issue 4, p23:1-23:37, 37p, 5 Diagrams

Témata: MACHINE theory, ALGORITHMS, MATHEMATICAL logic, MATHEMATICAL models, MATHEMATICAL functions software, COMPUTATIONAL complexity, BOOLEAN algebra

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

An Approximation Scheme for Stochastic Linear Programming and Its Application to Stochastic Integer Programs.

Autoři: Shmoys, David B. Swamy, Chaitanya

Zdroj: Journal of the ACM; Nov2006, Vol. 53 Issue 6, p978-1012, 35p

Témata: STOCHASTIC analysis, MATHEMATICAL optimization, PROBABILITY theory, LINEAR statistical models, POLYNOMIALS, ALGORITHMS

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

Fully Dynamic Algorithms for Chordal Graphs and Split Graphs.

Autoři: Ibarra, Louis

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 4, p40-40.20, 20p, 9 Diagrams, 1 Chart

Témata: ALGORITHMS, COMPUTER programming, QUERY (Information retrieval system), DATA structures, CHARTS, diagrams, etc.

Three New Combination Algorithms with the Minimal Change Property.

Autoři: Lam, Clement W.H. Soicher, Leonard H. McIlroy, M. Douglas

Zdroj: Communications of the ACM; Aug1982, Vol. 25 Issue 8, p555-562, 8p, 2 Charts

Témata: ALGORITHMS, PASCAL (Computer program language), MATHEMATICAL combinations, RECURSIVE programming, LEXICOGRAPHY, COMPUTATIONAL mathematics, COMBINATORICS, BOREL sets, DESCRIPTOR systems

A Near-Linear-Time Algorithm for Computing Replacement Paths in Planar Directed Graphs.

Autoři: EMEK, YUVAL PELEG, DAVID RODITTY, LIAM

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 4, p64:1-64:13, 13p, 3 Diagrams

Témata: ALGORITHMS, DIRECTED graphs, GRAPH theory, LINEAR time invariant systems, COMBINATORICS

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

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Dec1982, Vol. 25 Issue 12, p940-942, 3p

Témata: DATABASES, MATHEMATICAL models, COMPUTER systems

Korporace: ASSOCIATION for Computing Machinery

A Linear-Time Algorithm to Find a Separator in a Graph Excluding a Minor.

Autoři: Reed, Bruce Wood, David R.

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p39-39:16, 16p, 6 Diagrams

Témata: FOUNDATIONS of arithmetic, COMPUTATIONAL complexity, COMBINATORIAL geometry, INFORMATION science, MATHEMATICAL models, LINEAR A inscriptions, INTERNATIONAL copyright, AUTOMATIC theorem proving

Extraction and Classification of Dense Implicit Communities in the Web Graph.

Autoři: DOURISBOURE, YON GERACI, FILIPPO PELLEGRINI, MARCO

Zdroj: ACM Transactions on the Web; Apr2009, Vol. 3 Issue 2, p7-7-36, 36p, 9 Diagrams, 9 Charts, 1 Graph

Témata: WORLD Wide Web, INFORMATION sharing, COMPUTER science literature, HYPERLINKS, KEYWORDS

Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms.

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

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 4, p578-601, 24p

Témata: PATH analysis (Statistics), ALGORITHMS, MATHEMATICAL models, COMPUTER programming, MULTIVARIATE analysis, MATHEMATICAL analysis