Sciweavers

478 search results - page 34 / 96
» Diameter and Center Computations in Networks
Sort
View
DSN
2004
IEEE
15 years 3 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
DC
2010
14 years 12 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
IPPS
2002
IEEE
15 years 4 months ago
Utilization-Based Heuristics for Statically Mapping Real-Time Applications onto the HiPer-D Heterogeneous Computing System
Real-time applications continue to increase in importance as they are employed in various critical areas, such as command and control systems. These applications have traditionall...
Shoukat Ali, Jong-Kook Kim, Yang Yu, Shriram B. Gu...
STACS
2010
Springer
15 years 6 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
IEEECIT
2010
IEEE
14 years 10 months ago
An Innovative Course about Network Storage and System Virtualization Technologies in PKU
—“Network Storage and System Virtualization Technologies” is an up-to-date course opened by the school of electronics engineering and computer science of Peking University. T...
Xiaolin Wang, Xinxin Jin, Yingwei Luo, Zhenlin Wan...