Sciweavers

944 search results - page 20 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
AAAI
2010
14 years 11 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
AAAI
1998
14 years 11 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...
IJCAI
2003
14 years 11 months ago
On the application of least-commitment and heuristic search in temporal planning
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...
Antonio Garrido Tejero, Eva Onaindia
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
15 years 3 months ago
Comparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
JMLR
2006
145views more  JMLR 2006»
14 years 9 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street