Sciweavers

398 search results - page 14 / 80
» Tuning P Systems for Solving the Broadcasting Problem
Sort
View
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
14 years 9 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
P2P
2006
IEEE
122views Communications» more  P2P 2006»
15 years 3 months ago
2Fast : Collaborative Downloads in P2P Networks
P2P systems that rely on the voluntary contribution of bandwidth by the individual peers may suffer from freeriding. To address this problem, mechanisms enforcing fairness in band...
Pawel Garbacki, Alexandru Iosup, Dick H. J. Epema,...
IPPS
2003
IEEE
15 years 2 months ago
Anonymous Publish/Subscribe in P2P Networks
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
Ajoy Kumar Datta, Maria Gradinariu, Michel Raynal,...
CEC
2007
IEEE
15 years 1 months ago
An ant system with steps counter for the job shop scheduling problem
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...
Emanuel Tellez-Emiquez, Efrén Mezura-Montes...
WSC
2004
14 years 11 months ago
Retrospective Approximation Algorithms for the Multidimensional Stochastic Root-Finding Problem
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
Raghu Pasupathy, Bruce W. Schmeiser