Sciweavers

356 search results - page 70 / 72
» Optimization of Machine Descriptions for Efficient Use
Sort
View
DLOG
2004
13 years 8 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
ICML
1999
IEEE
14 years 7 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
FSKD
2007
Springer
98views Fuzzy Logic» more  FSKD 2007»
14 years 1 months ago
Learning Selective Averaged One-Dependence Estimators for Probability Estimation
Naïve Bayes is a well-known effective and efficient classification algorithm, but its probability estimation performance is poor. Averaged One-Dependence Estimators, simply AODE,...
Qing Wang, Chuan-hua Zhou, Jiankui Guo
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
AOSD
2009
ACM
13 years 11 months ago
Flexible calling context reification for aspect-oriented programming
Aspect-oriented programming (AOP) eases the development of profilers, debuggers, and reverse engineering tools. Such tools frequently rely on calling context information. However,...
Alex Villazón, Walter Binder, Philippe More...