3475 search results - page 339 / 695 » Backbones in Optimization and Approximation |
171
click to vote
AAAI
2007
15 years 9 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
156
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
145
click to vote
ESANN
2007
15 years 8 months ago
2007
This paper presents our Recurrent Control Neural Network (RCNN), which is a model-based approach for a data-efficient modelling and control of reinforcement learning problems in di...
150
Voted
CCCG
2006
15 years 8 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
181
click to vote
NIPS
1994
15 years 8 months ago
1994
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...