Sciweavers

492 search results - page 41 / 99
» The number of possibilities for random dating
Sort
View
ATAL
2008
Springer
13 years 10 months ago
An improved dynamic programming algorithm for coalition structure generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exh...
Talal Rahwan, Nicholas R. Jennings
ACSAC
2010
IEEE
13 years 6 months ago
Always up-to-date: scalable offline patching of VM images in a compute cloud
Patching is a critical security service that keeps computer systems up to date and defends against security threats. Existing patching systems all require running systems. With th...
Wu Zhou, Peng Ning, Xiaolan Zhang, Glenn Ammons, R...
IFIPTCS
2010
13 years 6 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
14 years 9 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
INFOCOM
2007
IEEE
14 years 3 months ago
Data Persistence in Large-Scale Sensor Networks with Decentralized Fountain Codes
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
Yunfeng Lin, Ben Liang, Baochun Li