2393 search results - page 335 / 479 » Bounds-Consistent Local Search |
ECAI
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
IJCAI
2001
13 years 11 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
IJCAI
2001
13 years 11 months ago
2001
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
IADIS
2003
13 years 11 months ago
2003
Our research focuses on web information management for people who want to monitor and use the World Wide Web (WWW) information, as their information resource. Web information is m...
IJCAI
2003
13 years 11 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...