8540 search results - page 1412 / 1708 » The Dynamic Servers Problem |
146
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Computational identification of blood-secretory proteins, especially proteins with differentially expressed genes in diseased tissues, can provide highly useful inform...
158
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
222
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
125
click to vote
COMCOM
2006
15 years 4 months ago
2006
Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities ...
157
click to vote
IT
2008
15 years 4 months ago
2008
provides a powerful abstraction basically allowing to perceiving all compute resources as entities that can be dynamically discovered and composed. These entities are called servic...