Sciweavers

92 search results - page 17 / 19
» Bottleneck Domination and Bottleneck Independent Domination ...
Sort
View
CAV
2008
Springer
96views Hardware» more  CAV 2008»
14 years 26 days ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
FTTCS
2006
132views more  FTTCS 2006»
13 years 11 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
PODC
2005
ACM
14 years 4 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CORR
2011
Springer
153views Education» more  CORR 2011»
13 years 2 months ago
On the Windfall and Price of Friendship: Inoculation Strategies on Social Networks
This article investigates selfish behavior in games where players are embedded in a social context. A framework is presented which allows us to measure the Windfall of Friendship...
Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid...
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 2 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos