Sciweavers

1157 search results - page 156 / 232
» Solving iterated functions using genetic programming
Sort
View
185
Voted
FOGA
2011
14 years 7 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
214
Voted
CP
2009
Springer
16 years 4 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 3 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
LCPC
2000
Springer
15 years 7 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
133
Voted
STACS
2000
Springer
15 years 7 months ago
Multi-linearity Self-Testing with Relative Error
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...
Frédéric Magniez