Result 1 to 20 of 53 total
Linear satisfiability algorithm for 3CNF formulas of certain signaling networks. (English)
J. Satisf. Boolean Model. Comput. 6, No. 1-3, 13-32 (2009).
1
The needles-in-haystack problem. (English)
Perner, Petra (ed.), Machine learning and data mining in pattern recognition. 6th international conference, MLDM 2009, Leipzig, Germany, July 23‒25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03069-7/pbk). Lecture Notes in Computer Science 5632. Lecture Notes in Artificial Intelligence, 516-524 (2009).
2
Discretization of target attributes for subgroup discovery. (English)
Perner, Petra (ed.), Machine learning and data mining in pattern recognition. 6th international conference, MLDM 2009, Leipzig, Germany, July 23‒25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03069-7/pbk). Lecture Notes in Computer Science 5632. Lecture Notes in Artificial Intelligence, 44-52 (2009).
3
Improved comprehensibility and reliability of explanations via restricted halfspace discretization. (English)
Perner, Petra (ed.), Machine learning and data mining in pattern recognition. 6th international conference, MLDM 2009, Leipzig, Germany, July 23‒25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03069-7/pbk). Lecture Notes in Computer Science 5632. Lecture Notes in Artificial Intelligence, 1-15 (2009).
4
Linear satisfiability algorithm for 3CNF formulas of certain signaling networks (English)
JSAT 6, No. 1-3, 13-32 (2009).
5
An alternative representation for QBF (English)
IC-AI, 531-536 (2009).
6
The needles-in-haystack problem (English)
MLDM, 516-524 (2009).
7
Improved comprehensibility and reliability of explanations via restricted halfspace discretization (English)
MLDM, 1-15 (2009).
8
Discretization of target attributes for subgroup discovery (English)
MLDM, 44-52 (2009).
9
The complexity of futile questioning (English)
FCS, 132-138 (2007).
10
An effective algorithm for the futile questioning problem. (English)
J. Autom. Reasoning 34, No. 1, 31-47 (2005).
11
Design of logic-based intelligent systems. (English)
Hoboken, NJ: John Wiley \& Sons (ISBN 0-471-48403-2/hbk; 978-0-471-72394-3/ebook). xii, 352~p. \sterling~50.50; EUR~70.80/hbk (2004).
12
An effective QBF solver for planning problems (English)
MSV/AMCS, 311-316 (2004).
13
Learning in a compiler for MINSAT algorithms. (English)
Comput. Res. Repos. 2003, Article No. 0312032 (2003).
14
Learning in a compiler for MINSAT algorithms. (English)
Theory Pract. Log. Program. 3, No. 3, 271-286 (2003).
15
A MINSAT approach for learning in logic domains. (English)
INFORMS J. Comput. 14, No. 1, 20-36 (2002).
16
Effective spell checking by learning user behavior. (English)
Appl. Artif. Intell. 13, No. 8, 725-742 (1999).
17
Learning to ask relevant questions. (English)
Artif. Intell. 111, No.1-2, 301-327 (1999).
18
A method for controlling errors in two-class classification (English)
COMPSAC, 186-191 (1999).
19
Effective logic computation. (English)
Chichester: Wiley. xi, 476 p. \sterling 65.00 (1998).
20
Result 1 to 20 of 53 total
Start
Contact
Print
General Help
