Sciweavers

12825 search results - page 420 / 2565
» Improved PLSOM algorithm
Sort
View
DAC
1996
ACM
15 years 11 months ago
A Fast State Reduction Algorithm for Incompletely Specified Finite State Machines
Abstract-- This paper proposes a state reduction algorithm for incompletely specified FSMs. The algorithm is based on iterative improvements. When the number of compatibles is like...
Hiroyuki Higuchi, Yusuke Matsunaga
PERCOM
2004
ACM
16 years 7 months ago
Analyzing Connectivity-Based Multi-Hop Ad-hoc Positioning
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
Regina Bischoff, Roger Wattenhofer
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
16 years 1 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
ICES
2001
Springer
100views Hardware» more  ICES 2001»
15 years 12 months ago
Evolutionary Design Calibration
Abstract. Evolutionary methods are now beginning to be used routinely in design applications. However, even with computing speeds growing continuously, for many complex design prob...
Thorsten Schnier, Xin Yao
3DIM
2001
IEEE
15 years 11 months ago
The Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Christian Langis, Michael A. Greenspan, Guy Godin