Sciweavers

12 search results - page 1 / 3
» Maximum Gain Round Trips with Cost Constraints
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
12 years 8 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
ISSRE
2002
IEEE
13 years 9 months ago
A Case Study Using the Round-Trip Strategy for State-Based Class Testing
A number of strategies have been proposed for state-based class testing. An important proposal was made by Chow [5] and adapted by Binder [3]: It consists in deriving test sequenc...
Giuliano Antoniol, Lionel C. Briand, Massimiliano ...
PODC
2009
ACM
14 years 5 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 4 months ago
Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
Allen Chuang, Albert Guillen i Fabregas, Lars K. R...
IWQOS
2004
Springer
13 years 10 months ago
A mechanism for equitable bandwidth allocation under QoS and budget constraints
— Equitable bandwidth allocation is essential when QoS requirements and purchasing power vary among users. To this end, we present a mechanism for bandwidth allocation based on d...
Sreenivas Gollapudi, D. Sivakumar