Sciweavers

24421 search results - page 421 / 4885
» Communicating Complex Systems
Sort
View
ICC
2011
IEEE
272views Communications» more  ICC 2011»
14 years 4 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
IESS
2007
Springer
165views Hardware» more  IESS 2007»
15 years 10 months ago
Data Reuse Driven Memory and Network-On-Chip Co-Synthesis
NoCs present a possible communication infrastructure solution to deal with increased design complexity and shrinking time-to-market. The communication infrastructure is a signific...
Ilya Issenin, Nikil Dutt
TMC
2008
127views more  TMC 2008»
15 years 4 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
IPPS
2008
IEEE
15 years 10 months ago
The design of a versatile, secure P2PSIP communications architecture for the public internet
Communications systems, encompassing VoIP, IM, and other personal media, present different challenges for P2P environments than other P2P applications. In particular, reliable com...
David A. Bryan, Bruce Lowekamp, Marcia Zangrilli
ICCS
2001
Springer
15 years 8 months ago
Towards an Accurate Model for Collective Communications
The performance of the MPI’s collective communications is critical in most MPI-based applications. A general algorithm for a given collective communication operation may not give...
Sathish S. Vadhiyar, Graham E. Fagg, Jack Dongarra