Sciweavers

1110 search results - page 58 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
15 years 1 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
DAC
2007
ACM
16 years 7 days ago
Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
Sander Stuijk, Twan Basten, Marc Geilen, Henk Corp...
DKE
2002
263views more  DKE 2002»
14 years 11 months ago
Data management issues in mobile and peer-to-peer environments
Mobile computing is a revolutionary technology, born as a result of remarkable advance in the development of computer hardware and wireless communication. It enables us to access ...
Budiarto, Shojiro Nishio, Masahiko Tsukamoto
MST
2010
93views more  MST 2010»
14 years 9 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
JHSN
2006
85views more  JHSN 2006»
14 years 11 months ago
A scalable intra-domain resource management architecture for DiffServ networks
With the rapid growth of the Internet into a global communication and commercial infrastructure, the need for Quality of Services (QoS) in the Internet becomes more and more import...
Haci A. Mantar, Ibrahim T. Okumus, Junseok Hwang, ...