364 search results - page 64 / 73 » A benchmark for the sorting network problem |
COMPULOG
1999
Springer
13 years 11 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
FORTE
2008
13 years 8 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...