Sciweavers

2498 search results - page 313 / 500
» Algorithms for the Topological Watershed
Sort
View
COLT
2003
Springer
14 years 1 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
ICPPW
2002
IEEE
14 years 1 months ago
A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
In large networks, maintaining precise global network state information is almost impossible. Many factors, such as non-negligible propagation delay, infrequent state updates due ...
Jun Zhou, Xin Yuan
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 1 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
ICCAD
1998
IEEE
105views Hardware» more  ICCAD 1998»
14 years 16 days ago
Fanout optimization under a submicron transistor-level delay model
In this paper we present a new fanout optimization algorithm which is particularly suitable for digital circuits designed with submicron CMOS technologies. Restricting the class o...
Pasquale Cocchini, Massoud Pedram, Gianluca Piccin...
IPPS
1997
IEEE
14 years 14 days ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya