Sciweavers

1713 search results - page 132 / 343
» Planning for Performance
Sort
View
AIPS
2009
15 years 5 months ago
Using Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
Jordan Tyler Thayer, Wheeler Ruml
140
Voted
ATAL
2007
Springer
15 years 10 months ago
Subjective approximate solutions for decentralized POMDPs
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
Anton Chechetka, Katia P. Sycara
149
Voted
DOLAP
2003
ACM
15 years 10 months ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos
133
Voted
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 8 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
ICCBR
2010
Springer
15 years 8 months ago
Goal-Driven Autonomy with Case-Based Reasoning
The vast majority of research on AI planning has focused on automated plan recognition, in which a planning agent is provided with a set of inputs that include an initial goal (or ...
Héctor Muñoz-Avila, Ulit Jaidee, Dav...