403 search results - page 77 / 81 » Sampling Bounds for Stochastic Optimization |
81
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
101
Voted
COMPGEOM
1994
ACM
15 years 3 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
AAAI
2007
15 years 2 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
112
Voted
TON
1998
14 years 11 months ago
1998
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
111
Voted
IJRR
2010
14 years 10 months ago
2010
Abstract— Accurate terrain estimation is critical for autonomous offroad navigation. Reconstruction of a 3D surface allows rough and hilly ground to be represented, yielding fast...