Sciweavers

2403 search results - page 166 / 481
» Optimal Randomized RANSAC
Sort
View
125
Voted
ATAL
2006
Springer
15 years 7 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
98
Voted
SIGGRAPH
1991
ACM
15 years 7 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
161
Voted
WSC
2008
15 years 5 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
130
Voted
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 3 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. ...
RAS
2002
129views more  RAS 2002»
15 years 3 months ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun