Sciweavers

5606 search results - page 775 / 1122
» Randomization Techniques for Graphs.
Sort
View
WSC
2008
15 years 9 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser
CDC
2008
IEEE
172views Control Systems» more  CDC 2008»
15 years 8 months ago
Convex relaxation approach to the identification of the Wiener-Hammerstein model
In this paper, an input/output system identification technique for the Wiener-Hammerstein model and its feedback extension is proposed. In the proposed framework, the identificatio...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
15 years 8 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
EUROPAR
2008
Springer
15 years 8 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...
ALT
2010
Springer
15 years 8 months ago
A Regularization Approach to Metrical Task Systems
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...