Sciweavers

11565 search results - page 122 / 2313
» Computing Minimal Mappings
Sort
View
CIS
2008
Springer
15 years 6 months ago
A Near-Optimal Redundancy Allocation Strategy that Minimizes a System's Vulnerability to Hazardous Events and Malicious Attacks
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
Frank Yeong-Sung Lin, Po-Hao Tsang, Kun-Dao Jiang
DAC
2005
ACM
16 years 5 months ago
Navigating registers in placement for clock network minimization
Yongqiang Lu, Cliff C. N. Sze, Xianlong Hong, Qian...
DAC
2006
ACM
16 years 5 months ago
Register binding for clock period minimization
Shih-Hsu Huang, Chun-Hua Cheng, Yow-Tyng Nieh, Wei...
CMSB
2008
Springer
15 years 5 months ago
Compositional Definitions of Minimal Flows in Petri Nets
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...
Michael Pedersen
IPPS
2006
IEEE
15 years 10 months ago
A self-stabilizing minimal dominating set algorithm with safe convergence
A self-stabilizing distributed system is a faulttolerant distributed system that tolerates any kind and any finite number of transient faults, such as message loss and memory cor...
Hirotsugu Kakugawa, Toshimitsu Masuzawa