Sciweavers

305 search results - page 12 / 61
» Using Answer Sets to Solve Belief Change Problems
Sort
View
AI
2011
Springer
14 years 6 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
VLDB
2004
ACM
103views Database» more  VLDB 2004»
15 years 5 months ago
Distributed Set Expression Cardinality Estimation
We consider the problem of estimating set-expression cardinality in a distributed streaming environment where rapid update streams originating at remote sites are continually tran...
Abhinandan Das, Sumit Ganguly, Minos N. Garofalaki...
COR
2007
80views more  COR 2007»
14 years 11 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
AAAI
2011
13 years 11 months ago
Dual Decomposition for Marginal Inference
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...
Justin Domke
ITS
2000
Springer
94views Multimedia» more  ITS 2000»
15 years 3 months ago
DT Tutor: A Decision-Theoretic, Dynamic Approach for Optimal Selection of Tutorial Actions
DT Tutor uses a decision-theoretic approach to select tutorial actions for coached problem solving that are optimal given the tutor's beliefs and objectives. It employs a mode...
R. Charles Murray, Kurt VanLehn