Sciweavers

4488 search results - page 705 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 9 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
ATAL
2005
Springer
15 years 8 months ago
Automated resource-driven mission phasing techniques for constrained agents
A constrained agent is limited in the actions that it can take at any given time, and a challenging problem is to design policies for such agents to do the best they can despite t...
Jianhui Wu, Edmund H. Durfee
IJCAI
2007
15 years 7 months ago
Optimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
Martin C. Cooper, Simon de Givry, Thomas Schiex
ECAI
2010
Springer
15 years 6 months ago
Brothers in Arms? On AI Planning and Cellular Automata
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
Jörg Hoffmann, Nazim Fatès, Héc...
JMLR
2008
209views more  JMLR 2008»
15 years 6 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger