Sciweavers

5448 search results - page 255 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
TKDE
1998
116views more  TKDE 1998»
15 years 6 months ago
Dependability and Performance Measures for the Database Practitioner
-- We estimate the availability, reliability, and mean transaction time (response time) for repairable database configurations, centralized or distributed, in which each service co...
Toby J. Teorey, Wee Teck Ng
CONCUR
1997
Springer
15 years 10 months ago
Probabilistic Concurrent Constraint Programming
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
SPAA
2010
ACM
15 years 11 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
ICC
2009
IEEE
121views Communications» more  ICC 2009»
16 years 1 months ago
Idle Channel Time Estimation in Multi-Hop Wireless Networks
—This paper presents a theoretical estimation for idle channel time in a multi-hop environment. Idle channel time is the time proportion of a node during which the channel state ...
Simon Odou, Steven Martin, Khaldoun Al Agha
CP
2006
Springer
15 years 10 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck