10568 search results - page 154 / 2114 » Computer Intelligence and Formalization |
WOLLIC
2010
Springer
15 years 3 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
AI
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper investigates the methods for learning predictive classifiers based on Bayesian belief networks (BN) – primarily unrestricted Bayesian networks and Bayesian m...
ECAI
2000
Springer
15 years 2 months ago
2000
Springer
This paper considers the use of logic-based languages for multi-agent negotiation. We begin by motivating the use of such languages, and introducing a formal model of logic-based n...
AGP
1997
IEEE
15 years 2 months ago
1997
IEEE
We present the rational construction of a generic domain for structural analysis anguages: Pattern(D ), where the parameter D is an abstract domain satisfying certain properties. ...
AE
1997
Springer
15 years 2 months ago
1997
Springer
In the running of a genetic algorithm, the population is liable to be con ned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a l...