130 search results - page 2 / 26 » Finding and Certifying Loops |
UAI
1994
13 years 6 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
HICSS
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper describes the findings of a case study that explores the micro level factors surrounding the processes of creativity and process management in a creative organization. ...
CADE
2003
Springer
14 years 5 months ago
2003
Springer
Foundational certified code systems seek to prove untrusted programs to be safe relative to safety policies given in terms of actual machine architectures, thereby improving the s...
JAR
2011
13 years 5 days ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
DGCI
2008
Springer
13 years 7 months ago
2008
Springer
Toric spaces being non-simply connected, it is possible to find in such spaces some loops which are not homotopic to a point: we call them toric loops. Some applications, such as t...