Sciweavers

417 search results - page 38 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
14 years 1 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
CG
2006
Springer
14 years 7 days ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 8 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 2 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
AAIM
2005
Springer
132views Algorithms» more  AAIM 2005»
14 years 2 months ago
Computation of Arbitrage in a Financial Market with Various Types of Frictions
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li