Sciweavers

181 search results - page 31 / 37
» Practical Artificial Intelligence Programming With Java
Sort
View
AIPS
2009
14 years 10 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
BMCBI
2011
14 years 4 months ago
A theoretical entropy score as a single value to express inhibitor selectivity
Background: Designing maximally selective ligands that act on individual targets is the dominant paradigm in drug discovery. Poor selectivity can underlie toxicity and side effect...
Joost C. M. Uitdehaag, Guido J. R. Zaman
CP
2009
Springer
15 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
155
Voted
CP
2009
Springer
15 years 10 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
176
Voted
CP
2009
Springer
15 years 10 months ago
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
Emmanuel Hebrard, Dániel Marx, Barry O'Sull...