6562 search results - page 145 / 1313 » Noetherianity and Combination Problems |
160
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
142
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
176
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
170
Voted
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
161
click to vote
CP
2008
Springer
15 years 7 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...