Sciweavers

146 search results - page 17 / 30
» Cyclic Leveling of Directed Graphs
Sort
View
KES
1998
Springer
14 years 20 days ago
Intensity reasoning by constraint propagation based on causal relationships
Many events in the world occur with some quantity that shows a level of the occurrence. This paper discusses reasoning with the normalized level of the occurrence, which we call i...
Koichi Yamada
CN
2006
98views more  CN 2006»
13 years 8 months ago
Internet resiliency to attacks and failures under BGP policy routing
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
Danny Dolev, Sugih Jamin, Osnat Mokryn, Yuval Shav...
BMCBI
2006
88views more  BMCBI 2006»
13 years 8 months ago
Effect of various normalization methods on Applied Biosystems expression array system data
Background: DNA microarray technology provides a powerful tool for characterizing gene expression on a genome scale. While the technology has been widely used in discovery-based m...
Catalin C. Barbacioru, Yulei Wang, Roger D. Canale...
JSSPP
2010
Springer
13 years 6 months ago
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
Yinglong Xia, Viktor K. Prasanna, James Li
INFOCOM
2008
IEEE
14 years 2 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang