3221 search results - page 234 / 645 » Termination of Linear Programs |
164
click to vote
DISOPT
2008
15 years 6 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
167
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
171
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
137
click to vote
SUM
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
180
click to vote
CP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...