Sciweavers

213 search results - page 34 / 43
» Heuristics for Planning with Action Costs
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
13 years 1 days ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
IJCAI
2003
14 years 11 months ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...
103
Voted
PROMAS
2004
Springer
15 years 3 months ago
Coordinating Teams in Uncertain Environments: A Hybrid BDI-POMDP Approach
Distributed partially observable Markov decision problems (POMDPs) have emerged as a popular decision-theoretic approach for planning for multiagent teams, where it is imperative f...
Ranjit Nair, Milind Tambe
WSC
2008
14 years 12 months ago
A simulation based optimization algorithm for slack reduction and workforce scheduling
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
Daniel Noack, Oliver Rose
72
Voted
NIPS
1997
14 years 11 months ago
Generalized Prioritized Sweeping
Prioritized sweeping is a model-based reinforcement learning method that attempts to focus an agent’s limited computational resources to achieve a good estimate of the value of ...
David Andre, Nir Friedman, Ronald Parr