1204 search results - page 45 / 241 » Hybrid Probabilistic Programs |
IFIP
2004
Springer
14 years 3 months ago
2004
Springer
CP
2005
Springer
14 years 3 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
HVC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...
EVOW
2007
Springer
14 years 4 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
UAI
1994
13 years 11 months ago
1994
In this paper we propose a new approach to probabilistic inference on belief networks, global conditioning, which is a simple generalization of Pearl's (1986b) method of loop...