2109 search results - page 119 / 422 » Solving Necklace Constraint Problems |
159
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
171
click to vote
BIBM
2010
IEEE
15 years 3 months ago
2010
IEEE
We propose a method for finding CRMs in a set of co-regulated genes. Each CRM consists of a set of binding sites of transcription factors. We wish to find CRMs involving the same t...
128
click to vote
MICAI
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a particle swarm optimizer for solving constrained optimization problems which adopts a very small population size (five particles). The proposed approach uses...
171
Voted
ICMLC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Many supervised and unsupervised learning algorithms depend on the choice of an appropriate distance metric. While metric learning for supervised learning tasks has a lon...
239
Voted
ICICIC
2006
IEEE
15 years 11 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...