Sciweavers

257 search results - page 16 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
AAAI
2011
13 years 9 months ago
Qualitative Numeric Planning
We consider a new class of planning problems involving a set of non-negative real variables, and a set of non-deterministic actions that increase or decrease the values of these v...
Siddharth Srivastava, Shlomo Zilberstein, Neil Imm...
UAI
2003
14 years 11 months ago
The Information Bottleneck EM Algorithm
Learning with hidden variables is a central challenge in probabilistic graphical models that has important implications for many real-life problems. The classical approach is usin...
Gal Elidan, Nir Friedman
64
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
Queueing Analysis of Loss Systems with Variable Optical Delay Lines
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Horng...
IJCAI
1989
14 years 10 months ago
Goal Ordering in Partially Ordered Plans
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par­ tially ordered plan is an operator precondition that is not yet achieved; operators,...
Mark Drummond, Ken Currie
SAC
2005
ACM
15 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová