Sciweavers

4377 search results - page 60 / 876
» Mass problems and randomness
Sort
View
EOR
2006
103views more  EOR 2006»
14 years 9 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
CDC
2008
IEEE
114views Control Systems» more  CDC 2008»
15 years 4 months ago
Dynamic Traveling Repairperson Problem for dynamic systems
— In this paper, we study the Dynamic Traveling Repairman Problem (DTRP) for dynamic systems. In the DTRP, customers are arising dynamically and randomly in a bounded region R, a...
Sleiman Itani, Emilio Frazzoli, Munther A. Dahleh
FOCS
2006
IEEE
15 years 3 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
IPL
2006
104views more  IPL 2006»
14 years 9 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
CSL
2004
Springer
15 years 3 months ago
Notions of Average-Case Complexity for Random 3-SAT
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
Albert Atserias