13376 search results - page 144 / 2676 » Problem Solving with |
164
Voted
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
116
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
138
click to vote
JETAI
2010
15 years 1 months ago
2010
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
133
click to vote
IMCSIT
2010
15 years 12 days ago
2010
The aim of this paper is to show that a special kind of boundary value problem for second-order ordinary differential equations which reduces to the problem of solving a tridiagona...
123
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...