Sciweavers

1402 search results - page 95 / 281
» Sparse-Memory Graph Search
Sort
View
WAW
2010
Springer
231views Algorithms» more  WAW 2010»
14 years 7 months ago
Modeling Traffic on the Web Graph
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
Mark R. Meiss, Bruno Gonçalves, Jose J. Ram...
COR
2010
146views more  COR 2010»
14 years 10 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
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 9 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
TCS
2008
14 years 10 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
14 years 11 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur