Sciweavers

10 search results - page 2 / 2
» Scaling up Heuristic Planning with Relational Decision Trees
Sort
View
ATAL
2009
Springer
13 years 11 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
GECCO
2008
Springer
114views Optimization» more  GECCO 2008»
13 years 5 months ago
Strategic positioning in tactical scenario planning
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
James M. Whitacre, Hussein A. Abbass, Ruhul A. Sar...
INFOCOM
2000
IEEE
13 years 8 months ago
A Modular Approach to Packet Classification: Algorithms and Results
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
Thomas Y. C. Woo
ICRA
2005
IEEE
138views Robotics» more  ICRA 2005»
13 years 10 months ago
Urban Object Recognition from Informative Local Features
Abstract— Autonomous mobile agents require object recognition for high level interpretation and localization in complex scenes. In urban environments, recognition of buildings mi...
Gerald Fritz, Christin Seifert, Lucas Paletta
ATAL
2009
Springer
13 years 11 months ago
Generalized model learning for reinforcement learning in factored domains
Improving the sample efficiency of reinforcement learning algorithms to scale up to larger and more realistic domains is a current research challenge in machine learning. Model-ba...
Todd Hester, Peter Stone