2661 search results - page 209 / 533 » Quantum Complexity Classes |
156
Voted
EUROGP
2004
Springer
15 years 7 months ago
2004
Springer
Most programs currently written by humans are object-oriented ones. Two of the greatest benefits of object oriented programming are the separation of interface from implementation,...
122
Voted
AUSAI
1998
Springer
15 years 7 months ago
1998
Springer
Naive Bayesian classi ers utilise a simple mathematical model for induction. While it is known that the assumptions on which this model is based are frequently violated, the predic...
157
Voted
COCO
1991
Springer
15 years 7 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
141
Voted
AIPS
2007
15 years 6 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...
127
Voted
AIPS
2008
15 years 6 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...