1650 search results - page 125 / 330 » The HOM problem is decidable |
146
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
229
Voted
TOPLAS
2008
15 years 4 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
125
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
In this paper, we present a general machine learning approach to the problem of deciding when to share probabilistic beliefs between agents for distributed monitoring. Our approac...
151
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
127
click to vote
EMO
2009
Springer
15 years 10 months ago
2009
Springer
When training Support Vector Machine (SVM), selection of a training data set becomes an important issue, since the problem of overfitting exists with a large number of training da...