7092 search results - page 689 / 1419 » Parallelizing constraint programs |
187
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
179
click to vote
CACM
2010
15 years 6 months ago
2010
Static program analysis techniques cannot know certain values, such as the value of user input or network state, at analysis time. While such unknown values need to be treated as ...
159
click to vote
DISOPT
2008
15 years 6 months ago
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
182
click to vote
LISP
2008
15 years 6 months ago
2008
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
181
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...