Sciweavers

1484 search results - page 119 / 297
» Ants meeting algorithms
Sort
View
DATE
2002
IEEE
131views Hardware» more  DATE 2002»
15 years 2 months ago
Passive Constrained Rational Approximation Algorithm Using Nevanlinna-Pick Interpolation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
Carlos P. Coelho, Luis Miguel Silveira, Joel R. Ph...
ICTAI
1993
IEEE
15 years 2 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
FPL
2000
Springer
122views Hardware» more  FPL 2000»
15 years 1 months ago
A Placement Algorithm for FPGA Designs with Multiple I/O Standards
State-of-the-art FPGAs possess I/O resources that can be configured to support a wide variety of I/O standards [1]. In such devices, the I/O resources are grouped into banks. One o...
Jason Helge Anderson, Jim Saunders, Sudip Nag, Cha...
CSC
2006
14 years 11 months ago
A New Migration Model For Distributed Genetic Algorithms
Genetic algorithms are heuristic search algorithm used in science, engineering and many other areas. They are powerful but slow because of their evolutionary nature that mimics th...
Taisir Eldos
JCO
2006
150views more  JCO 2006»
14 years 10 months ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson