1710 search results - page 272 / 342 » Parallelism in Structured Newton Computations |
SPAA
2009
ACM
14 years 4 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
ICDCS
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
PARELEC
2006
IEEE
14 years 4 months ago
2006
IEEE
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
SPAA
2005
ACM
14 years 3 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
PODC
2004
ACM
14 years 3 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...