Sciweavers

1146 search results - page 35 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
ICAART
2010
INSTICC
14 years 4 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
JAIR
2008
123views more  JAIR 2008»
13 years 7 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
3DIM
1997
IEEE
14 years 14 hour ago
A System for Semi-Automatic Modeling of Complex Environments
We present a perception system, called Artisan, that semi-automatically builds 3-D models of a robot’s workspace. Range images are acquired with a scanning laser rangefinder an...
Andrew Edie Johnson, Regis Hoffman, Jim Osborn, Ma...
ICMLA
2007
13 years 9 months ago
Learning complex problem solving expertise from failures
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu
ICDE
2012
IEEE
224views Database» more  ICDE 2012»
11 years 10 months ago
Exploiting Common Subexpressions for Cloud Query Processing
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
Yasin N. Silva, Paul-Ake Larson, Jingren Zhou