Sciweavers

3422 search results - page 258 / 685
» Random Subset Optimization
Sort
View
FOCS
2009
IEEE
15 years 10 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
ATAL
2006
Springer
15 years 10 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
SIGGRAPH
1991
ACM
15 years 9 months ago
Spectrally optimal sampling for distribution ray tracing
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
Don P. Mitchell
WSC
2008
15 years 8 months ago
Speeding up call center simulation and optimization by Markov chain uniformization
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
Eric Buist, Wyean Chan, Pierre L'Ecuyer
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 6 months ago
Scheduling and Codeword Length Optimization in Time Varying Wireless Networks
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...
Mehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. ...