506 search results - page 37 / 102 » Where Is the Value in a Program Verifier |
109
Voted
COMPGEOM
1996
ACM
15 years 4 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
117
click to vote
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
126
click to vote
JMLR
2006
15 years 13 days ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
199
Voted
ICLP
2009
Springer
16 years 1 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...
127
click to vote
ENTCS
2007
15 years 1 days ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...