506 search results - page 29 / 102 » Where Is the Value in a Program Verifier |
93
Voted
UAI
2004
15 years 1 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
84
Voted
SODA
1998
ACM
15 years 1 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
100
click to vote
MP
2008
15 years 12 days ago
2008
We analyze the rate of local convergence of the augmented Lagrangian method for nonlinear semidefinite optimization. The presence of the positive semidefinite cone constraint requ...
ICSE
2005
IEEE-ACM
16 years 16 days ago
2005
IEEE-ACM
Pair programming is a programming technique in which two programmers use one computer to work together on the same task. There is an ongoing debate over the value of pair programm...
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...