Výsledky vyhledávání - Analysis of Algorithms and Problem Complexity—Non-numerical Algorithms and Problems General Terms

Analysis of Deterministic Tracking of Multiple Objects using a Binary Sensor Network

Autoři: Yann Busnel Leonardo Querzoni Roberto Baldoni a další

Přispěvatelé: Yann Busnel Leonardo Querzoni Roberto Baldoni a další

Zdroj: http://www.dis.uniroma1.it/~midlab/articoli/BQBBK09.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Non-numerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Binary Sensor Network, Distributed algorithm, Impossibility and Characterization, Passive Trajectory Tracking

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.1691; http://www.dis.uniroma1.it/~midlab/articoli/BQBBK09.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.1691
http://www.dis.uniroma1.it/~midlab/articoli/BQBBK09.pdf

Matching Algorithmic Bounds for Finding a Brouwer Fixed Point.

Autoři: XI CHEN XIAOTIE DENG

Zdroj: Journal of the ACM; Jul2008, Vol. 55 Issue 3, p1-26, 26p, 1 Diagram, 8 Charts

Témata: BOUNDARY value problems, ALGORITHMS, NONLINEAR boundary value problems, INITIAL value problems, COMPLEX variables, MATHEMATICAL physics, FIXED point theory, NONLINEAR operators

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

Autoři: Jansen, Klaus Zhang, Hu

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

Témata: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

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

Secure Multiparty Computation of Approximations.

Autoři: Feigenbaum, Joan Ishai, Yuval Malkin, Tal a další

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p435-472, 38p

Témata: ALGORITHMS, MATHEMATICAL analysis, APPROXIMATION theory, FUNCTIONAL analysis, MATHEMATICS, ALGEBRA

Dependent Rounding and Its Applications to Approximation Algorithms.

Autoři: Gandhi, Rajiv Khuller, Samir Parthasarathy, Srinivasan a další

Zdroj: Journal of the ACM; May2006, Vol. 53 Issue 3, p324-360, 37p

Témata: ALGORITHMS, APPROXIMATION theory, BIPARTITE graphs, GRAPH theory, VECTOR analysis

Subexponential Parameterized Algorithms on Bounded-Genus Graphs and H-Minor-Free Graphs.

Autoři: Demaine, Erik D. Fomin, Fedor V. Hajiaghayi, Mohammadtaghi a další

Zdroj: Journal of the ACM; Nov2005, Vol. 52 Issue 6, p866-893, 28p

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

A Unified Approach to Scheduling on Unrelated Parallel Machines.

Autoři: KUMAR, V. S. ANIL MARATHE, MADHAV V. PARTHASARATHY, SRINIVASAN a další

Zdroj: Journal of the ACM; Aug2009, Vol. 56 Issue 5, p28-28:31, 31p, 1 Chart

Témata: CONVEX programming, PRODUCTION scheduling, LINEAR programming, VECTOR analysis, PARALLEL algorithms, PARALLEL computers, PARALLEL programs (Computer programs), PARALLEL processing, AFFINITY scheduling for parallel processing

Efficient Algorithms for the 2-Gathering Problem.

Autoři: Shalita, Alon Zwick, Uri

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p34:1-34:20, 20p, 5 Diagrams, 4 Charts

Témata: ALGORITHMS, NUMERICAL analysis, GRAPH theory, BIPARTITE graphs, DIRECTED graphs, GRAPHIC methods

Optimality of an Algorithm Solving the Bottleneck Tower of Hanoi Problem.

Autoři: DINITZ, YEFIM SOLOMON, SHAY

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p25-25:9, 9p, 3 Diagrams

Témata: ALGORITHMS, PUZZLES, PROBLEM solving, MATHEMATICS, THEORY

Simultaneous Source Location.

Autoři: Andreev, Konstantin Garrod, Charles Golovin, Daniel a další

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p16:1-16:17, 17p, 2 Diagrams, 3 Charts

Témata: ALGORITHMS, GRAPHIC methods, GRAPH theory, DIMENSIONAL analysis, APPROXIMATION theory, FUNCTIONAL analysis

Approximating Connectivity Augmentation Problems.

Autoři: Nutova, Zeev

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 6 Issue 1, p5:1-5:19, 19p

Témata: APPROXIMATION theory, FUNCTIONAL analysis, ALGORITHMS, RATIO & proportion, POLYNOMIALS, ALGEBRA

New Hardness Results for Congestion Minimization and Machine Scheduling.

Autoři: Chuzhoy, Julia Naor, Joseph (Seffi)

Zdroj: Journal of the ACM; Sep2006, Vol. 53 Issue 5, p707-721, 15p

Témata: COMPUTER networks, BOTTLENECKS (Manufacturing), COMPUTER scheduling, DIRECTED graphs, MATHEMATICAL analysis

Connectivity-based localization of large scale sensor networks with complex shape

Autoři: Sol Lederer Yue Wang Jie Gao a další

Přispěvatelé: Sol Lederer Yue Wang Jie Gao a další

Zdroj: http://www.cs.sunysb.edu/~jgao/paper/layout.pdf.

Témata: General Terms, Algorithms, Theory Additional Key Words and Phrases, Sensor Networks, Combinatorial Delaunay Complex, Embedding, Localization, Graph Rigidity

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.8379; http://www.cs.sunysb.edu/~jgao/paper/layout.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.8379
http://www.cs.sunysb.edu/~jgao/paper/layout.pdf

A Better Approximation Ratio for the Vertex Cover Problem.

Autoři: Karakostas, George

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p41-41:8, 8p

Témata: POLYNOMIALS, FINANCIAL ratios, EQUALITY, ALGEBRA, ALGORITHMS, NETWORK analysis (Planning), APPROXIMATION theory, BIVECTORS

Algorithms for Capacitated Rectangle Stabbing and Lot Sizing with Joint Set-Up Costs.

Autoři: EVEN, GUY LEVI, RETSEF RAWITZ, DROR a další

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p34-34:17, 17p, 3 Diagrams

Témata: ALGORITHMS, RECTANGLES, SETUP costs, APPROXIMATION theory, COMBINATORICS, MATHEMATICAL analysis

Max-Coloring and Online Coloring with Bandwidths on Interval Graphs.

Autoři: PEMMARAJU, SRIRAM V. RAMAN, RAJIV VARADARAJAN, KASTURI

Zdroj: ACM Transactions on Algorithms; 2011, Vol. 7 Issue 3, p35-35:21, 21p

Témata: GRAPH coloring, BANDWIDTHS, COMPUTER memory management, COMPUTER operating systems, INFORMATION retrieval, GRAPH theory, APPROXIMATION algorithms, BUFFER storage (Computer science)

Determining Approximate Shortest Paths on Weighted Polyhedral Surfaces.

Autoři: Aleksandrov, L. Maheshwari, A. Sack, J.-R.

Zdroj: Journal of the ACM; Jan2005, Vol. 52 Issue 1, p25-53, 29p, 10 Diagrams, 2 Charts

Témata: ALGORITHMS, APPROXIMATION theory, POLYHEDRAL functions, GEOMETRY, POLYHEDRA

Polynomial-Time Data Reduction for DOMINATING SET.

Autoři: Alber, Jochen Fellows, Michael R. Niedermeier, Rolf

Zdroj: Journal of the ACM; May2004, Vol. 51 Issue 3, p363-384, 22p

Témata: NP-complete problems, COMPUTATIONAL complexity, GRAPH theory, DATA reduction, TOPOLOGY, COMBINATORIAL optimization, MATHEMATICAL optimization

Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications.

Autoři: Fomin, Fedor V. Grandoni, Fabrizio Pyatkin, Artem V. a další

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p9-9:17, 17p, 1 Chart

Témata: GRAPH theory, COMBINATORICS, MATHEMATICAL analysis, COMPUTATIONAL mathematics, GRAPH algorithms, ALGORITHMS