2109 search results - page 22 / 422 » Solving Necklace Constraint Problems |
116
click to vote
FLAIRS
2007
15 years 4 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
114
Voted
ICLP
2005
Springer
15 years 7 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
120
click to vote
CSCLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
105
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...