2861 search results - page 416 / 573 » Constraint Programming |
129
Voted
DISOPT
2007
15 years 2 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
109
click to vote
MOR
2002
15 years 2 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
129
Voted
JOT
2010
15 years 28 days ago
2010
This paper describes how to use annotation to provide semantic information. The applications include the automatic construction of a GUI so that the user input is constrained to a...
114
Voted
TASLP
2010
15 years 26 days ago
2010
—Many important audio coding applications, such as streaming and playback of stored audio, involve offline compression. In such scenarios, encoding delays no longer represent a ...
91
Voted
IPPS
2010
IEEE
15 years 12 days ago
2010
IEEE
This paper is the first extensive performance study of a recently proposed parallel programming model, called Concurrent Collections (CnC). In CnC, the programmer expresses her co...