Sciweavers

596 search results - page 74 / 120
» Search Strategies for Hybrid Search Spaces
Sort
View
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 2 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
ICMLA
2003
13 years 10 months ago
A Distributed Reinforcement Learning Approach to Pattern Inference in Go
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
Myriam Abramson, Harry Wechsler
AI
2000
Springer
13 years 8 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
EOR
2006
148views more  EOR 2006»
13 years 9 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
13 years 11 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen