Sciweavers

7758 search results - page 417 / 1552
» On the Number of Distributive Lattices
Sort
View
191
Voted
FTDCS
2004
IEEE
15 years 10 months ago
Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
Rolf Winter, Thomas Zahn, Jochen H. Schiller
192
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 9 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
DCOSS
2008
Springer
15 years 8 months ago
Techniques for Improving Opportunistic Sensor Networking Performance
Abstract. A number of recently proposed mobile sensor network architectures rely on uncontrolled, or weakly-controlled mobility to achieve sensing coverage over time at low cost, a...
Shane B. Eisenman, Nicholas D. Lane, Andrew T. Cam...
158
Voted
PTS
2007
99views Hardware» more  PTS 2007»
15 years 8 months ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan
164
Voted
CCGRID
2010
IEEE
15 years 8 months ago
Dynamic Auction Mechanism for Cloud Resource Allocation
We propose a dynamic auction mechanism to solve the allocation problem of computation capacity in the environment of cloud computing. Truth-telling property holds when we apply a s...
Wei-Yu Lin, Guan-Yu Lin, Hung-Yu Wei