Sciweavers

5329 search results - page 196 / 1066
» The Weighted Majority Algorithm
Sort
View
GLOBECOM
2007
IEEE
16 years 25 days ago
Multiconstrained QoS Routing: Greedy is Good
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
Guoliang Xue, Weiyi Zhang
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
15 years 6 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
PERCOM
2003
ACM
16 years 6 months ago
Dynamic Bandwidth Management for Single-Hop Ad Hoc Wireless Networks
Distributed weighted fair scheduling schemes for QoS support in wireless networks have not yet become standard. In this paper we propose an Admission Control and Dynamic Bandwidth...
Samarth H. Shah, Kai Chen, Klara Nahrstedt
RTSS
2003
IEEE
15 years 11 months ago
Quick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
James H. Anderson, Aaron Block, Anand Srinivasan
TASLP
2002
60views more  TASLP 2002»
15 years 6 months ago
A psychoacoustic approach to combined acoustic echo cancellation and noise reduction
This paper presents and compares algorithms for combined acoustic echo cancellation and noise reduction for hands-free telephones. A structure is proposed, consisting of a conventi...
Stefan Gustafsson, Rainer Martin, Peter Jax, Peter...