620 search results - page 12 / 124 » Likelihood Computations Using Value Abstraction |
EUROPAR
1997
Springer
15 years 3 months ago
1997
Springer
Abstract. The serialization constraints induced by the detection and enforcement of true data dependences have always been regarded as requirements for correct execution. We propos...
93
Voted
COMPUTER
2002
14 years 11 months ago
2002
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
108
click to vote
CG
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
93
Voted
IAT
2006
IEEE
15 years 5 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...