Výsledky vyhľadávania - Analysis of Algorithms and Prob- lem Complexity—General

Path Planning using Corridors and its Applications

Autori: Arno Kamphuis Mark H. Overmars The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Arno Kamphuis Mark H. Overmars The Pennsylvania State University CiteSeerX Archives

Zdroj: http://gamma.cs.unc.edu/VR08_Cityscapes/PAPERS/utrecht.pdf.

Predmety: Index Terms, I.2.8 [Computing Methodologies, Artificial Intelligence—Problem Solving, Control Methods, and Search, F.2.0 [Theory of Computation, Analysis of Algorithms and Prob- lem Complexity—General, K.8.0 [Computing Milieux, Personal Computing—General (Games

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.504.3953; http://gamma.cs.unc.edu/VR08_Cityscapes/PAPERS/utrecht.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.504.3953
http://gamma.cs.unc.edu/VR08_Cityscapes/PAPERS/utrecht.pdf

The NP-Completeness Column: The Many Limits on Approximation.

Autori: Johnson, David S.

Zdroj: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p473-489, 17p

Predmety: ALGORITHMS, MATHEMATICAL optimization, SURETYSHIP & guaranty, MATHEMATICAL analysis

Osoby: GAREY, M. R., FREEMAN, W. H.

Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.

Autori: Kaplan, Haim Lewenstein, Moshe Shafrir, Nira a ďalší

Zdroj: Journal of the ACM; Jul2005, Vol. 52 Issue 4, p602-626, 25p, 1 Diagram, 1 Chart

Predmety: ALGORITHMS, APPROXIMATION theory, FUNCTIONAL analysis, MULTIGRAPH, BIPARTITE graphs

Hardness of Approximating the Shortest Vector Problem in Lattices.

Autori: Khot, Subhash

Zdroj: Journal of the ACM; Sep2005, Vol. 52 Issue 5, p789-808, 20p

Predmety: ALGORITHMS, VECTOR analysis, LATTICE theory, POLYNOMIALS, APPROXIMATION theory, HARDNESS

Lattice Problems in NP ∩ coNP.

Autori: Aharonov, Dorit Regev, Oded

Zdroj: Journal of the ACM; Sep2005, Vol. 52 Issue 5, p749-765, 17p

Predmety: APPROXIMATION theory, ALGORITHMS, FOURIER series, MATHEMATICAL functions, FUNCTIONAL analysis

AdWords and Generalized Online Matching.

Autori: Mehta, Aranyak Saberi, Amin Vazirani, Umesh a ďalší

Zdroj: Journal of the ACM; Oct2007, Vol. 54 Issue 5, p1-19, 19p, 2 Graphs

Predmety: ONLINE algorithms, WEB search engines, ALGORITHMS, SEARCH engines, ONLINE data processing

A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem.

Autori: JIANER CHEN YANG LIU SONGJIAN LU a ďalší

Zdroj: Journal of the ACM; Oct2008, Vol. 55 Issue 5, p21:1-21:19, 19p, 3 Diagrams

Predmety: FEEDBACK control systems, VERTEX operator algebras, DIRECTED graphs, COMPUTATIONAL intelligence, ALGORITHMS, DIVISION rings

On the Bicriteria k-Server Problem.

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 7 Issue 1, p6:1-6:19, 19p

Predmety: ONLINE algorithms, COMPUTATIONAL complexity, PERFORMANCE, MATHEMATICAL optimization, MATHEMATICAL analysis, STATISTICAL weighting

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Jan1982, Vol. 25 Issue 1, p69-72, 4p

Predmety: PERIODICALS, COMPUTER programming, INFORMATION technology, ALGORITHMS

COMPLEXITY AND PARALLEL PROCESSING: AN INTERVIEW WITH RICHARD KARP.

Autori: Frenkel, Karen A.

Zdroj: Communications of the ACM; Feb1986, Vol. 29 Issue 2, p112-117, 6p, 1 Diagram

Predmety: COMPUTER scientists

Osoby: KARP, Richard

Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits.

Autori: Pettie, Seth Ramachandran, Vijaya

Zdroj: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 1, p5:1-5:27, 27p, 1 Diagram, 5 Charts

Predmety: SPANNING trees, ALGORITHMS, LINEAR systems, TREE graphs, ALGEBRA

COMBINATORICS, COMPLEXITY, AND RANDOMNESS.

Autori: Karp, Richard M.

Zdroj: Communications of the ACM; Feb1986, Vol. 29 Issue 2, p98-111, 14p, 8 Diagrams, 6 Charts, 6 Graphs

Predmety: COMPUTER science, COMBINATION (Linguistics)

The Approximability of MAX CSP with Fixed-Value Constraints.

Autori: DEINEKO, VLADIMIR JONSSON, PETER KLASSON, MIKAEL a ďalší

Zdroj: Journal of the ACM; Sep2008, Vol. 55 Issue 4, p16:1-16:37, 37p, 3 Charts

Predmety: CONSTRAINT satisfaction, MATHEMATICAL variables, POLYNOMIALS, ALGORITHMS, SET theory, MATHEMATICAL models, BOOLEAN algebra, MATRICES (Mathematics), PERMUTATIONS

Randomized Fast Design of Short DNA Words.

Autori: Ming-Yang Kao Sanghi, Manan Schweller, Robert

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 4, p43-43:24, 24p, 9 Diagrams, 1 Chart

Predmety: DEOXYRIBOSE, MATHEMATICAL analysis, ALGEBRA, PROBABILITY learning, GENETIC programming, CODE generators, BIOLOGICAL psychiatry, RANDOM polynomials

Optimal Envy-Free Pricing with Metric Substitutability.

Autori: Ning Chen Ghosh, Arpita Vassilvitskii, Sergei

Zdroj: EC: Electronic Commerce; 2008, p60-69, 10p, 3 Diagrams

Predmety: PRICING, COST, PROFIT, CONSUMERS, CONJOINT analysis

ABSTRACTS from other ACM Publications.

Zdroj: Communications of the ACM; Oct82, Vol. 25 Issue 10, p748-753, 6p

Predmety: DATA compression, CODING theory, DATABASE management, COMPUTER industry, COMPUTER programming

Truthful Unsplittable Flow for Large Capacity Networks.

Autori: Azar, Yossi Gamzu, Iftah Gutner, Shai

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 2, p36:1-36:20, 20p, 5 Diagrams

Predmety: MATHEMATICAL optimization, ALGORITHMS, GAME theory, APPROXIMATION theory, ITERATIVE methods (Mathematics), MONOTONE operators

Pilot-Based Simplified ML and Fast Algorithm for Frequency Offset Estimation in OFDMA Uplink.

Autori: Yonghong Zeng Leyman, A. Rahim

Zdroj: IEEE Transactions on Vehicular Technology; May2008, Vol. 57 Issue 3, p1723-1732, 10p, 1 Diagram, 2 Charts, 11 Graphs

Predmety: ORTHOGONAL frequency division multiplexing, SPREAD spectrum communications, BROADBAND communication systems, WIRELESS communications, COMPUTATIONAL complexity, ELECTRONIC data processing, DATA transmission systems

Cross-Disciplinary Perspectives on Meta-Learning for Algorithm Selection.

Autori: SMITH-MILES, KATE A.

Zdroj: ACM Computing Surveys; Dec2008, Vol. 41 Issue 1, p1-25, 25p, 2 Diagrams, 2 Charts

Predmety: ALGORITHMS, LEARNING, MACHINE learning, MACHINE theory, ARTIFICIAL intelligence

Schema Mapping Discovery from Data Instances.

Autori: GOTTLOB, GEORG SENELLART, PIERRE

Zdroj: Journal of the ACM; Jan2010, Vol. 57 Issue 2, p6-6:37, 37p, 1 Diagram, 5 Charts

Predmety: DATABASES, KEYWORDS, INDEXING, DATA mapping, DATA transmission systems, ELECTRONIC information resources