2974 search results - page 140 / 595 » Model-Driven Constraint Programming |
162
click to vote
JOTA
2011
15 years 1 months ago
2011
In this paper we consider the linear symmetric cone programming (SCP). At a KarushKuhn-Tucker (KKT) point of SCP, we present the important equivalent conditions for the nonsingula...
187
click to vote
ASP
2005
Springer
15 years 12 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
126
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
198
click to vote
BIRTHDAY
2007
Springer
16 years 16 days ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
170
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...