Sciweavers

835 search results - page 68 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
WSC
2007
14 years 1 months ago
Allocation of simulation runs for simulation optimization
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
Alireza Kabirian, Sigurdur Ólafsson
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 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
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 10 months ago
Structure-Aware Stochastic Control for Transmission Scheduling
In this report, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decisio...
Fangwen Fu, Mihaela van der Schaar
GECCO
2008
Springer
134views Optimization» more  GECCO 2008»
13 years 12 months ago
Branch predictor on-line evolutionary system
In this work a branch prediction system which utilizes evolutionary techniques is introduced. It allows the predictor to adapt to the executed code and thus to improve its perform...
Karel Slany
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 5 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl