Sciweavers

23119 search results - page 4404 / 4624
» From Domain to Requirements
Sort
View
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
16 years 1 hour ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
IWQOS
2004
Springer
15 years 12 months ago
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
Theodoros Salonidis, Leandros Tassiulas
LSGRID
2004
Springer
15 years 12 months ago
Grid Portal Interface for Interactive Use and Monitoring of High-Throughput Proteome Annotation
High-throughput proteome annotation refers to the activity of extracting information from all proteins in a particular organism using bioinformatics software on a high performance ...
Atif Shahab, Danny Chuon, Toyotaro Suzumura, Wilfr...
MDM
2004
Springer
15 years 12 months ago
Middleware Providing Dynamic Group Communication Facility for Cellular Phone Applications
In this paper, we propose a middleware library for efficiently developing distributed cooperative applications consisting of a large number of cellular phones with Java executors....
Kouji Nishigaki, Keiichi Yasumoto, Takaaki Umedu, ...
MIDDLEWARE
2004
Springer
15 years 12 months ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
« Prev « First page 4404 / 4624 Last » Next »