2398 search results - page 197 / 480 » Constraint Programming and Graph Algorithms |
188
Voted
PPOPP
2012
ACM
14 years 2 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
211
click to vote
SOFTVIS
2010
ACM
15 years 6 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
175
Voted
JAIR
2008
15 years 6 months ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
141
click to vote
SIAMJO
2008
15 years 6 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
280
Voted
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...