1534 search results - page 266 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
118
Voted
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a two-leveled mobile agent system for electronic commerce. It is based on mobile agents as mediators and uses the publish/subscribe paradigm for registration an...
DSN
2005
IEEE
15 years 6 months ago
2005
IEEE
Fault-tolerant protocols, asynchronous and synchronous alike, make stationary fault assumptions: only a fraction f of the total n nodes may fail. Whilst a synchronous protocol is ...
118
click to vote
PPOPP
2012
ACM
13 years 8 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
128
click to vote
ICDCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...
105
click to vote
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...