Sciweavers

518 search results - page 6 / 104
» Beating a Random Assignment
Sort
View
CPC
2004
70views more  CPC 2004»
14 years 11 months ago
Random Assignment with Integer Costs
Robert Parviainen
GLOBECOM
2008
IEEE
15 years 6 months ago
Distributed Multi-Interface Multi-Channel Random Access
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 1 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
WSC
2008
15 years 2 months ago
Assignment of probabilities to events for combat simulation
Multitrajectory simulation allows explicit management of random events by allowing particular events to be resolved by random draw, by a deterministic choice, or by creating new s...
John B. Gilmer Jr., Frederick J. Sullivan
RSA
2002
75views more  RSA 2002»
14 years 11 months ago
On the expected value of the minimum assignment
: We prove the main conjecture of the paper "On the expected value of the minimum assignment" by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures ...
Marshall W. Buck, Clara S. Chan, David P. Robbins