Sciweavers

130 search results - page 4 / 26
» The Complexity of Optimal Planning and a More Efficient Meth...
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
ICTAI
2000
IEEE
13 years 11 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 7 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
ICC
2009
IEEE
161views Communications» more  ICC 2009»
13 years 5 months ago
Energy-Efficient Itinerary Planning for Mobile Agents in Wireless Sensor Networks
Compared to conventional wireless sensor networks (WSNs) that are operated based on the client-server computing model, mobile agent (MA) systems provide new capabilities for energy...
Min Chen, Victor C. M. Leung, Shiwen Mao, Taekyoun...
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule