Sciweavers

2438 search results - page 438 / 488
» Scheduling problems for parallel and distributed systems
Sort
View
132
Voted
PODC
2005
ACM
15 years 9 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
IV
2002
IEEE
124views Visualization» more  IV 2002»
15 years 9 months ago
Numerical Solving of Geometric Constraints
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
Samy Ait-Aoudia
SPAA
2005
ACM
15 years 9 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
IJHPCA
2008
151views more  IJHPCA 2008»
15 years 4 months ago
WE-AMBLE: a Workflow Engine To Manage Awareness in Collaborative Grid Environments
Grid computing intends to share heterogeneous resources in dynamic service-based environments. This kind of systems has the major advantages of enabling rapid composition of distr...
Pilar Herrero, José Luis Bosque, Manuel Sal...
ICS
2010
Tsinghua U.
15 years 8 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling