Sciweavers

1639 search results - page 113 / 328
» Anytime Heuristic Search
Sort
View
97
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
CP
2005
Springer
15 years 6 months ago
Multi-point Constructive Search
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
J. Christopher Beck
ICML
2005
IEEE
16 years 1 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
103
Voted
HM
2005
Springer
87views Optimization» more  HM 2005»
15 years 6 months ago
A Taxonomy of Cooperative Search Algorithms
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
Mohammed El-Abd, Mohamed Kamel
SAGA
2001
Springer
15 years 5 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz