Sciweavers

7978 search results - page 254 / 1596
» Combining shared-coin algorithms
Sort
View
ICRA
2000
IEEE
136views Robotics» more  ICRA 2000»
15 years 9 months ago
Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm
The need to register data is abundant in applications such as: world modeling, part inspection and manufacturing, object recognition, pose estimation, robotic navigation, and reve...
Jason P. Luck, Charles Q. Little, William Hoff
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 9 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
DCC
1998
IEEE
15 years 9 months ago
A Locally Optimal Design Algorithm for Block-Based Multi-Hypothesis Motion-Compensated Prediction
Multi-hypothesis motion-compensated prediction extends traditional motion-compensated prediction used in video coding schemes. Known algorithms for block-based multi-hypothesis mo...
Markus Flierl, Thomas Wiegand, Bernd Girod
177
Voted
IPPS
1998
IEEE
15 years 9 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
127
Voted
SPDP
1993
IEEE
15 years 8 months ago
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
B. B. Prahlada Rao, R. C. Hansdah