Sciweavers

350 search results - page 48 / 70
» Complexity of Planning with Partial Observability
Sort
View
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 8 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
ATAL
2009
Springer
14 years 2 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...
WEBI
2010
Springer
13 years 5 months ago
Learning Task Specific Web Services Compositions with Loops and Conditional Branches from Example Executions
Majority of the existing approaches to service composition, including the widely popular planning based techniques, are not able to automatically compose practical workflows that ...
Harini Veeraraghavan, Roman Vaculín, Manuel...
NIPS
2007
13 years 9 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
WCE
2007
13 years 9 months ago
Power Flow Modelling of a Self-excited Induction Generator
—This paper presents power flow models of a self-excited induction generator. These models are used for steady-state power flow calculation in electric power systems in which a g...
Thanatchai Kulworawanichpong, P. Sangsarawut