Sciweavers

1639 search results - page 111 / 328
» Anytime Heuristic Search
Sort
View
90
Voted
AAAI
2000
15 years 2 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
82
Voted
AAAI
1997
15 years 2 months ago
Evidence for Invariants in Local Search
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
David A. McAllester, Bart Selman, Henry A. Kautz
EOR
2007
163views more  EOR 2007»
15 years 19 days ago
The multi-depot vehicle routing problem with inter-depot routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heurist...
Benoit Crevier, Jean-François Cordeau, Gilb...
77
Voted
CORR
2010
Springer
179views Education» more  CORR 2010»
14 years 11 months ago
Active Testing for Face Detection and Localization
—We provide a novel search technique which uses a hierarchical model and a mutual information gain heuristic to efficiently prune the search space when localizing faces in images...
Raphael Sznitman, Bruno Jedynak
91
Voted
ICPR
2008
IEEE
15 years 7 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz