1710 search results - page 226 / 342 » High-Level Programs and Program Conditions |
UAI
1996
13 years 11 months ago
1996
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
ECCC
2002
13 years 9 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
SIGCSE
2002
ACM
13 years 9 months ago
2002
ACM
We adopt the view that CS1 labs are not programming assignments, and that they should not be used for grading students or assessing their level of understanding. Instead, we think...
SP
2002
IEEE
13 years 9 months ago
2002
IEEE
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
CDC
2009
IEEE
13 years 7 months ago
2009
IEEE
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...