167 search results - page 11 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
103
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
145
Voted
EVOW
2009
Springer
15 years 7 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...
127
Voted
JAIR
2010
15 years 1 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
141
Voted
AUSAI
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
169
Voted
CONSTRAINTS
1998
15 years 2 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...