2393 search results - page 226 / 479 » Bounds-Consistent Local Search |
133
click to vote
AIMSA
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
122
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
131
click to vote
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
153
click to vote
EVOW
2009
Springer
15 years 8 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
141
click to vote
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...