Sciweavers

213 search results - page 36 / 43
» Heuristics for Planning with Action Costs
Sort
View
AAAI
1997
13 years 8 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
VTC
2010
IEEE
138views Communications» more  VTC 2010»
13 years 5 months ago
Resource Allocation Scheme for Minimizing Uplink Interference in Hierarchical Cellular Networks
—Hierarchical cellular networks (HCNs), in which femtocells are deployed in the coverage of a conventional macrocell, offer a cost effective solution to achieve high user capacit...
Sung-Yeop Pyun, Dong-Ho Cho
AAAI
2012
11 years 10 months ago
Characterizing Multi-Agent Team Behavior from Partial Team Tracings: Evidence from the English Premier League
Real-world AI systems have been recently deployed which can automatically analyze the plan and tactics of tennis players. As the game-state is updated regularly at short intervals...
Patrick Lucey, Alina Bialkowski, Peter Carr, Eric ...
PODS
2001
ACM
143views Database» more  PODS 2001»
14 years 7 months ago
Pipelining in Multi-Query Optimization
Database systems frequently have to execute a set of related queries, which share several common subexpressions. Multi-query optimization exploits this, by finding evaluation plan...
Nilesh N. Dalvi, Sumit K. Sanghai, Prasan Roy, S. ...
VLDB
1999
ACM
87views Database» more  VLDB 1999»
13 years 11 months ago
Query Optimization for XML
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect...
Jason McHugh, Jennifer Widom