2974 search results - page 102 / 595 » Model-Driven Constraint Programming |
138
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
150
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
164
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
167
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
With energy consumption becoming one of the first-class optimization parameters in computer system design, compilation techniques that consider performance and energy simultaneous...
151
click to vote
PARA
1995
Springer
15 years 9 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...