1041 search results - page 152 / 209 » Randomizing Reductions of Search Problems |
CONSTRAINTS
2011
13 years 2 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Proportional integral derivative (PID) controller tuning is an area of interest for researchers in many disciplines of science and engineering. This paper presents a new algorithm...
AAAI
2008
13 years 10 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
AAAI
1998
13 years 9 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...