Sciweavers

2498 search results - page 130 / 500
» Algorithms for the Topological Watershed
Sort
View
ICCNMC
2005
Springer
15 years 11 months ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman
VLSID
1996
IEEE
133views VLSI» more  VLSID 1996»
15 years 10 months ago
Allocation and Binding in Data Path Synthesis Using a Genetic Algorithm Approach
A technique for allocatzon and binding for data path synthesis (DPS) using a Genetic Algorithm (GA) approach has been developed. The proposed genetic algorithm uses a non-conventi...
Chittaranjan A. Mandal, P. P. Chakrabarti, Sujoy G...
UC
2005
Springer
15 years 11 months ago
Using Genetic Algorithms to Evolve Behavior in Cellular Automata
Abstract. It is an unconventional computation approach to evolve solutions instead of calculating them. Although using evolutionary computation in computer science dates back to th...
Thomas Bäck, Ron Breukelaar
ICC
2000
IEEE
105views Communications» more  ICC 2000»
15 years 9 months 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
IPL
2010
109views more  IPL 2010»
15 years 1 months ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno