Sciweavers

4800 search results - page 302 / 960
» OO Distributed Programming is Not Distributed OO Programming
Sort
View
IJCAI
2007
15 years 4 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
ISCAPDCS
2007
15 years 4 months ago
An autonomic element design for a distributed object system
Current research in autonomic computing suffers from the lack of a common definition of the basic autonomic entities. Defining and developing the basic autonomic entities and maki...
M. Muztaba Fuad, Debzani Deb, Michael J. Oudshoorn
WOA
2007
15 years 4 months ago
An Agent Based Solution for Dispatching Items in a Distributed Environment
—This paper describes Herald, an agent based toolkit for dispatching and processing items in a distributed environment. Herald is suitable for scenarios where the process could b...
Christian Vecchiola, Alberto Grosso, Andrea Passad...
COR
2010
164views more  COR 2010»
15 years 3 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
IANDC
2007
84views more  IANDC 2007»
15 years 3 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...