3591 search results - page 283 / 719 » Typing linear constraints |
204
click to vote
JSSPP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
192
click to vote
LPNMR
1995
Springer
15 years 10 months ago
1995
Springer
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...
196
click to vote
IJCAI
2007
15 years 8 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
168
click to vote
AAAI
2006
15 years 8 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
206
click to vote
EOR
2008
15 years 7 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...