Sciweavers

3424 search results - page 240 / 685
» Automated Testing of Classes
Sort
View
JAIR
2008
123views more  JAIR 2008»
15 years 6 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
FAC
2008
178views more  FAC 2008»
15 years 6 months ago
Modeling and validating Mondex scenarios described in UML and OCL with USE
This paper describes the Mondex case study with UML class diagrams and restricting OCL constraints. The constraints have been formulated either as OCL class invariants or as OCL pr...
Mirco Kuhlmann, Martin Gogolla
PAMI
2006
114views more  PAMI 2006»
15 years 6 months ago
Nonparametric Supervised Learning by Linear Interpolation with Maximum Entropy
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Maya R. Gupta, Robert M. Gray, Richard A. Olshen
AI
2005
Springer
15 years 6 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
EC
2000
171views ECommerce» more  EC 2000»
15 years 6 months ago
Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions
Building blocks are a ubiquitous feature at all levels of human understanding, from perception through science and innovation. Genetic algorithms are designed to exploit this prev...
John H. Holland