Sciweavers

24 search results - page 4 / 5
» Anytime Coordination Using Separable Bilinear Programs
Sort
View
ATAL
2007
Springer
13 years 12 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
PDCAT
2007
Springer
13 years 12 months ago
A Distributed Virtual Machine for Parallel Graph Reduction
We present the architecture of nreduce, a distributed virtual machine which uses parallel graph reduction to run programs across a set of computers. It executes code written in a ...
Peter M. Kelly, Paul D. Coddington, Andrew L. Wend...
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 5 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ICPP
2002
IEEE
13 years 10 months ago
Region Synchronization in Message Passing Systems
The development of correct synchronization code for distributed programs is a challenging task. In this paper, we propose an aspect oriented technique for developing synchronizati...
Gurdip Singh, Ye Su
ISORC
1998
IEEE
13 years 10 months ago
Specification of Real-Time Interaction Constraints
We present a coordination language and its semantics for specification and implementation of object-oriented realtime systems. Real-time systems operate under real-time constraint...
Brian Nielsen, Shangping Ren, Gul Agha