182 search results - page 32 / 37 » A Theory of Strict P-completeness |
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing sy...
NIPS
2007
13 years 9 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
IQ
2001
13 years 9 months ago
2001
: Corporate household data not only refers to the strict hierarchical structure about and within the corporation, but also the variety of inter-organizational relationships. It is ...
ADCM
2010
13 years 7 months ago
2010
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
AI
2007
Springer
13 years 7 months ago
2007
Springer
Argumentation theory has become an important topic in the field of AI. The basic idea is to construct arguments in favor and against a statement, to select the “acceptable” o...