Sciweavers

838 search results - page 2 / 168
» Finding Optimal Solutions to Atomix
Sort
View
ECAI
2010
Springer
13 years 7 months ago
On Finding Compromise Solutions in Multiobjective Markov Decision Processes
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...
Patrice Perny, Paul Weng
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
13 years 10 months ago
Fitness function for finding out robust solutions on time-varying functions
Evolutionary Computations in dynamic/uncertain environments have attracted much attention. Studies regarding this research subjects can be classified into four categories: Noise, ...
Hisashi Handa
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
13 years 10 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
Christoph Dürr, Mathilde Hurand
RAS
2002
129views more  RAS 2002»
13 years 6 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun