4860 search results - page 530 / 972 » SNPs Problems, Complexity, and Algorithms |
111
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
147
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
135
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
138
Voted
AAAI
2007
15 years 7 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...
139
click to vote
CISSE
2008
Springer
15 years 6 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...