130 search results - page 2 / 26 » A CSP Search Algorithm with Responsibility Sets and Kernels |
170
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
115
Voted
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. The paper focuses on the efficiency of the hybrid evolutionary algorithm (HEA) for solving the global optimization problem arising in electronic imaging. The particular v...
ICML
2006
IEEE
16 years 9 days ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
114
Voted
CP
2011
Springer
13 years 11 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
AI
2005
Springer
14 years 11 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...