1414 search results - page 143 / 283 » Randomness and Universal Machines |
94
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
102
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Estimation of Distribution Algorithms (EDAs) are a class of evolutionary algorithms that use machine learning techniques to solve optimization problems. Machine learning is used t...
103
Voted
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Kernel machines rely on an implicit mapping of the data such that non-linear classification in the original space corresponds to linear classification in the new space. As kernel ...
111
Voted
NIPS
2003
15 years 2 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
56
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper investigates several issues in the problem of detecting handwritten markings, or annotations, on printed documents. One issue is to define the appropriate units over wh...