Sciweavers

664 search results - page 37 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
EOR
2006
125views more  EOR 2006»
14 years 10 months ago
A genetic algorithm for robotic assembly line balancing
Flexibility and automation in assembly lines can be achieved by the use of robots. The robotic assembly line balancing (RALB) problem is defined for robotic assembly line, where d...
Gregory Levitin, Jacob Rubinovitz, Boris Shnits
MOBICOM
2012
ACM
13 years 10 days ago
Energy-based rate adaptation for 802.11n
Rate adaptation (RA) has been used to achieve high goodput. In this work, we explore to use RA for energy efficiency in 802.11n NICs. We show that current MIMO RA algorithms are ...
Chi-Yu Li, Chunyi Peng, Songwu Lu, Xinbing Wang
KBS
1998
66views more  KBS 1998»
14 years 9 months ago
A hierarchical case representation using context guided retrieval
This paper presents a hierarchical case representation using a context guided retrieval method. The performance of this method is compared to that of a simpler flat file represe...
Ian D. Watson, Srinath Perera
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
15 years 10 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
COMPGEOM
2011
ACM
14 years 1 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...