9325 search results - page 297 / 1865 » The decentralized implementability problem |
138
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
150
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
The GridBASE framework for database-driven grid computing is presented. The design and a prototype implementation of the framework is discussed. Industry-strength database technol...
138
click to vote
TMC
2002
15 years 3 months ago
2002
This paper proposes a scheme of optimal resource management for reverse-link transmissions in multimedia wideband code-division multiple-access (WCDMA) communications. It is to gua...
161
click to vote
CSC
2009
15 years 5 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
123
click to vote
ENTCS
2006
15 years 4 months ago
2006
We review the recently developed technique of Monte Carlo model checking and show how it can be applied to the implementation problem for I/O Automata. We then consider some open ...