728 search results - page 18 / 146 » Efficient Searching with Linear Constraints |
101
Voted
MICAI
2004
Springer
15 years 7 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...
119
click to vote
ACL
2009
14 years 11 months ago
2009
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
119
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
128
click to vote
COCOA
2008
Springer
15 years 3 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...
CP
2006
Springer
15 years 5 months ago
2006
Springer
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...