Sciweavers

213 search results - page 17 / 43
» Heuristics for Planning with Action Costs
Sort
View
AIPS
2011
12 years 11 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
ATAL
2009
Springer
14 years 2 months ago
Incorporating helpful behavior into collaborative planning
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
Ece Kamar, Ya'akov Gal, Barbara J. Grosz
SOFSEM
2007
Springer
14 years 1 months ago
Incremental Learning of Planning Operators in Stochastic Domains
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
Javad Safaei, Gholamreza Ghassem-Sani
VLDB
1994
ACM
114views Database» more  VLDB 1994»
13 years 11 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
HEURISTICS
2000
127views more  HEURISTICS 2000»
13 years 7 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett