Sciweavers

2862 search results - page 274 / 573
» Bicriteria Network Design Problems
Sort
View
174
Voted
JUCS
2008
135views more  JUCS 2008»
15 years 6 months ago
Approximation to a Behavioral Model for Estimating Traffic Aggregation Scenarios
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
Alberto E. Garcia, Klaus D. Hackbarth
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
COR
2007
109views more  COR 2007»
15 years 6 months ago
Assessing performance and uncertainty in developing carpet reverse logistics systems
TheUScarpetindustryisstrivingtoreacha40%diversionratefromlandfillsby2012,accordingtoamemorandum of understanding signed by industry and government officials in 2002. As a result...
Markus Biehl, Edmund Prater, Matthew J. Realff
CANPC
2000
Springer
15 years 11 months ago
Transparent Network Connectivity in Dynamic Cluster Environments
Improvements in microprocessor and networking performance have made networks of workstations a very attractive platform for high-end parallel and distributed computing. However, t...
Xiaodong Fu, Hua Wang, Vijay Karamcheti
BCS
2008
15 years 8 months ago
Overcoming Software Fragility with Interacting Feedback Loops and Reversible Phase Transitions
Programs are fragile for many reasons, including software errors, partial failures, and network problems. One way to make software more robust is to design it from the start as a ...
Peter Van Roy