7092 search results - page 705 / 1419 » Parallelizing constraint programs |
233
click to vote
EPIA
1999
Springer
15 years 11 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
193
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
183
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
185
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
165
click to vote
JAIR
2010
15 years 5 months ago
2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...