Sciweavers

1603 search results - page 91 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
124
Voted
PAAMS
2010
Springer
15 years 8 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
130
Voted
CPAIOR
2008
Springer
15 years 5 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
96
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Microphone position optimization for planar superdirective beamforming
The performance of a fixed beamformer highly depends on the position of the microphones in the array. In this paper, different heuristic optimisation approaches for arbitrary pla...
Ina Kodrasi, Thomas Rohdenburg, Simon Doclo
173
Voted
SOCO
2012
Springer
13 years 11 months ago
Variable mesh optimization for continuous optimization problems
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
165
Voted
JAIR
2010
167views more  JAIR 2010»
15 years 2 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal