719 search results - page 72 / 144 » Solving Sparse Linear Constraints |
109
Voted
CSCLP
2008
Springer
15 years 21 days ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
85
Voted
EOR
2008
14 years 11 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
DAC
1997
ACM
15 years 3 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
96
Voted
COCOA
2008
Springer
15 years 21 days 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...
94
Voted
RC
2002
14 years 10 months ago
2002
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...