Sciweavers

1439 search results - page 155 / 288
» Fast approximation of centrality
Sort
View
119
Voted
ICNP
2000
IEEE
15 years 5 months ago
A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
Haiyun Luo, Songwu Lu
96
Voted
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
15 years 4 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
83
Voted
ATAL
2008
Springer
15 years 2 months ago
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
Xiaoming Zheng, Sven Koenig
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
15 years 2 months ago
Zonotopes as bounding volumes
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
Leonidas J. Guibas, An Nguyen, Li Zhang
102
Voted
ICASSP
2010
IEEE
15 years 28 days ago
On expectation maximization based channel and noise estimation beyond the vector Taylor series expansion
In this work, we show how expectation maximization based simultaneous channel and noise estimation can be derived without a vector Taylor series expansion. The central idea is to ...
Friedrich Faubel, John W. McDonough, Dietrich Klak...