Sciweavers

13214 search results - page 193 / 2643
» Pseudorandomness for network algorithms
Sort
View
NETWORKS
1998
15 years 6 months ago
Project scheduling with multiple modes: A comparison of exact algorithms
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
Sönke Hartmann, Andreas Drexl
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
16 years 3 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
ICCCN
2008
IEEE
16 years 1 months ago
Impairment-Aware Manycast Algorithms over Optical Burst-Switched Networks
— We discuss the effect of physical impairments on manycasting service over optical burst-switched (OBS) networks. Signal quality degradation in manycast networks is an important...
Balagangadhar G. Bathula, Rajesh R. C. Bikram, Vin...
IPPS
2007
IEEE
16 years 26 days ago
Effects of Replica Placement Algorithms on Performance of structured Overlay Networks
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
ICPP
2003
IEEE
15 years 12 months ago
A Recovery Algorithm for Reliable Multicasting in Reliable Networks
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
Danyang Zhang, Sibabrata Ray, Rajgopal Kannan, S. ...