210 search results - page 35 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
ICTAI
2002
IEEE
15 years 2 months ago
2002
IEEE
There are many machine learning algorithms currently available. In the 21st century, the problem no longer lies in writing the learner, but in choosing which learners to run on a ...
102
click to vote
AIPS
2011
14 years 1 months ago
2011
Applying learning techniques to acquire action models is an area of intense research interest. Most previous works in this area have assumed that there is a significant amount of...
CP
2005
Springer
15 years 2 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
110
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
CP
2005
Springer
15 years 2 months ago
2005
Springer
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...