Sciweavers

1493 search results - page 85 / 299
» Local resilience of graphs
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 8 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
PODC
2004
ACM
14 years 1 months ago
Load balancing and locality in range-queriable data structures
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
James Aspnes, Jonathan Kirsch, Arvind Krishnamurth...
IICS
2010
Springer
13 years 11 months ago
Local Aspects of the Global Ranking of Web Pages
Started in 1998, the search engine Google estimates page importance using several parameters. PageRank is one of those. Precisely, PageRank is a distribution of probability on the ...
Fabien Mathieu, Laurent Viennot
COR
2010
146views more  COR 2010»
13 years 8 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
SG
2007
Springer
14 years 1 months ago
Semantic Information and Local Constraints for Parametric Parts in Interactive Virtual Construction
Abstract. This paper introduces a semantic representation for virtual prototyping in interactive virtual construction applications. The representation reflects semantic information...
Peter Biermann, Christian Fröhlich, Marc Eric...