7092 search results - page 371 / 1419 » Parallelizing constraint programs |
136
click to vote
ENTCS
2008
15 years 3 months ago
2008
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
144
click to vote
ACL
2010
15 years 1 months ago
2010
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
136
click to vote
EACL
2009
ACL Anthology
15 years 29 days ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
118
click to vote
MP
2011
14 years 6 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
108
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...