2636 search results - page 170 / 528 » Linear Programming |
101
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
122
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
110
click to vote
SPIN
2007
Springer
15 years 8 months ago
2007
Springer
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
115
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
115
click to vote
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....