Sciweavers

518 search results - page 25 / 104
» Beating a Random Assignment
Sort
View
CORR
1999
Springer
98views Education» more  CORR 1999»
14 years 11 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
96
Voted
ALT
2008
Springer
15 years 8 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
EOR
2006
125views more  EOR 2006»
14 years 11 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
INFOCOM
2006
IEEE
15 years 5 months ago
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
Michael J. Neely
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 1 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...