Sciweavers

16596 search results - page 162 / 3320
» Generalized Assignment Problems
Sort
View
FOCS
1997
IEEE
15 years 6 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
15 years 6 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
ICCBR
2010
Springer
15 years 6 months ago
Reducing the Memory Footprint of Temporal Difference Learning over Finitely Many States by Using Case-Based Generalization
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Matt Dilts, Héctor Muñoz-Avila
105
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
A General Model and Analysis of Physical Layer Capture in 802.11 Networks
Abstract— While packet capture has been observed in real implementations of 802.11 devices, there is a lack of accurate models that describe the phenomenon. We present a general ...
Hoon Chang, Vishal Misra, Dan Rubenstein
111
Voted
TWC
2008
91views more  TWC 2008»
15 years 2 months ago
Throughput and Channel Access Statistics of Generalized Selection Multiuser Scheduling
To provide a near-optimal low-complexity solution to parallel multiuser scheduling in code-division multiple-access (CDMA), we propose generalized selection multiuser diversity (GS...
Yao Ma, Jinghua Jin, Dongbo Zhang