Browsing by Subject "Randomized algorithms"
Now showing items 1-2 of 2
-
Article
Work-competitive scheduling for cooperative computing with dynamic groups
(2005)The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is ...
-
Conference Object
Work-competitive scheduling for cooperative computing with dynamic groups
(2003)The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable ...