Sciweavers

990 search results - page 8 / 198
» Using evolution strategies to solve DEC-POMDP problems
Sort
View
IJCAI
2003
13 years 9 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
AAAI
1996
13 years 9 months ago
Deciding to Remind During Collaborative Problem Solving: Empirical Evidence for Agent Strategies
Previous work suggests that reminding a conversational partner of mutually known information depends on the conversants' attentional state, their resource limits and the reso...
Pamela W. Jordan, Marilyn A. Walker
EVOW
2003
Springer
14 years 1 months ago
Hybrid Evolution Strategy-Downhill Simplex Algorithm for Inverse Light Scattering Problems
The rough surface inverse scattering problem is approached with a combination of evolutionary strategies and the simplex method. The surface, assumed one-dimensional and perfectly ...
Demetrio Macías, Gustavo Olague, Eugenio R....
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
13 years 11 months ago
Solving identification problem for asynchronous finite state machines using genetic algorithms
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
Xiaojun Geng
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
13 years 11 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente