Sciweavers

25 search results - page 1 / 5
» Intelligent Model Selection for Hillclimbing Search in Compu...
Sort
View
AIPS
2008
13 years 7 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
CIMCA
2005
IEEE
13 years 10 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
EVOW
2006
Springer
13 years 8 months ago
Optimisation of Constant Matrix Multiplication Operation Hardware Using a Genetic Algorithm
Abstract. The efficient design of multiplierless implementations of constant matrix multipliers is challenged by the huge solution search spaces even for small scale problems. Prev...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
AISB
1995
Springer
13 years 8 months ago
The Ant Colony Metaphor for Searching Continuous Design Spaces
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
George Bilchev, Ian C. Parmee