270 search results - page 4 / 54 » Exploiting Problem Structure for Solution Counting |
UAI
2004
13 years 9 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
ICCE
2007
13 years 9 months ago
2007
: Intelligent tutoring systems assist medical faculty in training and equipping students with the required clinical reasoning skills. Plausible student solutions to a given problem...
PARA
1995
Springer
13 years 11 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...