9842 search results - page 195 / 1969 » Problem complexity |
104
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
134
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
127
click to vote
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
Although usually classifier error is the main concern in publications, in real applications classifier evaluation complexity may play a large role as well. In this paper, a simple...
113
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
101
click to vote
AIPS
2006
15 years 3 months ago
2006
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....