113 search results - page 13 / 23 » Design and Usage of a New Benchmark Problem for Genetic Prog... |
ICALP
2005
Springer
14 years 1 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...
ICCD
2000
IEEE
14 years 4 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
EC
2008
13 years 7 months ago
2008
This work describes how evolutionary computation can be used to synthesize lowlevel image operators that detect interesting points on digital images. Interest point detection is a...
HEURISTICS
2008
13 years 6 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
ASPLOS
2004
ACM
14 years 1 months ago
2004
ACM
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...