Sciweavers

10 search results - page 1 / 2
» Alternating control tree search for knapsack covering proble...
Sort
View
HEURISTICS
2010
13 years 2 months ago
Alternating control tree search for knapsack/covering problems
Lars Magnus Hvattum, Halvard Arntzen, Arne L&oslas...
CP
2000
Springer
13 years 9 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
AAAI
1998
13 years 6 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
14 years 3 days ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
13 years 11 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene