Sciweavers

769 search results - page 84 / 154
» Where Is the Proof
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 10 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
WOA
2007
13 years 10 months ago
An Agent Based Solution for Dispatching Items in a Distributed Environment
—This paper describes Herald, an agent based toolkit for dispatching and processing items in a distributed environment. Herald is suitable for scenarios where the process could b...
Christian Vecchiola, Alberto Grosso, Andrea Passad...
ALGORITHMICA
2008
56views more  ALGORITHMICA 2008»
13 years 9 months ago
Eliminating Cycles in the Discrete Torus
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
Béla Bollobás, Guy Kindler, Imre Lea...
CORR
2008
Springer
189views Education» more  CORR 2008»
13 years 9 months ago
Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli
JCO
2008
102views more  JCO 2008»
13 years 9 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving