Sciweavers

3049 search results - page 155 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
HEURISTICS
2006
197views more  HEURISTICS 2006»
15 years 6 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
GLOBECOM
2008
IEEE
16 years 26 days ago
Prioritized Maximal Scheduling in Wireless Networks
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
Qiao Li, Rohit Negi
ISCIS
2003
Springer
15 years 11 months ago
A New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorr...
Hamid Beigy, Mohammad Reza Meybodi
FOCS
2008
IEEE
16 years 26 days ago
The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well)
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
Michael Ben-Or, Avinatan Hassidim