Sciweavers

550 search results - page 48 / 110
» Decision-Theoretic Simulated Annealing
Sort
View
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
14 years 1 months ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
GECCO
2006
Springer
216views Optimization» more  GECCO 2006»
14 years 26 days ago
Comparative analysis of the sailor assignment problem
In this work the performance of several local search and metaheuristic methods is compared to previously reported work using evolutionary algorithms. The results show that while m...
Joseph Vannucci, Deon Garrett, Dipankar Dasgupta
ICC
2000
IEEE
105views Communications» more  ICC 2000»
14 years 24 days ago
Reconfiguration Algorithms Based on META-Heuristics for Multihop WDM Lightwave Networks
The logical configuration of a WDM network can be changed by reassigning wavelengths to tunable transceivers of nodes. In this paper, we develop reconfiguration algorithms to obtai...
Manabu Kato, Yuji Oie
IWANN
1995
Springer
14 years 22 days ago
Test Pattern Generation for Analog Circuits Using Neural Networks and Evolutive Algorithms
This paper presents a comparative analysis of neural networks, simulated annealing, and genetic algorithms in the determination of input patterns for testing analog circuits. The ...
José Luis Bernier, Juan J. Merelo Guerv&oac...
DLOG
2007
13 years 11 months ago
Induction of Optimal Semi-distances for Individuals based on Feature Sets
Abstract. Many activities related to semantically annotated resources can be enabled by a notion of similarity among them. We propose a method for defining a family of semi-distan...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito