Sciweavers

1859 search results - page 67 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICTAI
2007
IEEE
15 years 11 months ago
Adaptive Lookahead for Answer Set Computation
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
Guohua Liu, Jia-Huai You
CCIA
2005
Springer
15 years 10 months ago
Comparison of Strategies Based on Evolutionary Computation for the Design of Similarity Functions
One of the main keys in case-based reasoning system is the retrieval phase, where the most similar cases are retrieved by means of a similarity function. According to the problem, ...
Albert Fornells-Herrera, J. Camps Dausà, El...
AIEDU
2008
162views more  AIEDU 2008»
15 years 4 months ago
Designing Learning by Teaching Agents: The Betty's Brain System
The idea that teaching others is a powerful way to learn is intuitively compelling and supported in the research literature. We have developed computer-based, domain-independent Te...
Krittaya Leelawong, Gautam Biswas
RECOMB
2005
Springer
16 years 5 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
RECOMB
2003
Springer
16 years 5 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson