Result 1 to 10 of 10 total
Horn upper bounds and renaming. (English)
J. Satisf. Boolean Model. Comput. 7, No. 1, 1-15 (2010).
1
Reinforcement learning via approximation of the Q-function. (English)
J. Exp. Theor. Artif. Intell. 22, No. 3, 219-235 (2010).
2
Reinforcement learning via approximation of the Q-function (English)
J. Exp. Theor. Artif. Intell. 22, No. 3, 219-235 (2010).
3
Horn upper bounds and renaming (English)
JSAT 7, No. 1, 1-15 (2010).
4
Combinatorial problems for Horn clauses. (English)
Lipshteyn, Marina (ed.) et al., Graph theory, computational intelligence and thought. Essays dedicated to Martin Charles Golumbic on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-02028-5/pbk). Lecture Notes in Computer Science 5420, 54-65 (2009).
5
Combinatorial problems for Horn clauses (English)
Graph Theory, Computational Intelligence and Thought, 54-65 (2009).
6
Horn complements: towards Horn-to-Horn belief revision (English)
AAAI, 466-471 (2008).
7
Horn upper bounds and renaming. (English)
Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2007. 10th international conference, Lisbon, Portugal, May 28‒31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 80-93 (2007).
8
Horn upper bounds and renaming (English)
SAT, 80-93 (2007).
9
Contribution à l’étude du mouvement du corps rigide à n dimensions autour d’un point fixe. (French)
C.I.M.E., I Ciclo Bressanone 1971, Stereodynamics, 81-100 (1972).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
