Sciweavers

874 search results - page 84 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
143
Voted
GPCE
2009
Springer
15 years 4 months ago
Mapping problem-space to solution-space features: a feature interaction approach
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
Frans Sanen, Eddy Truyen, Wouter Joosen
116
Voted
WAIM
2009
Springer
15 years 5 months ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
BMCBI
2010
141views more  BMCBI 2010»
15 years 1 months ago
Computing and visually analyzing mutual information in molecular co-evolution
Background: Selective pressure in molecular evolution leads to uneven distributions of amino acids and nucleotides. In fact one observes correlations among such constituents due t...
Sebastian Bremm, Tobias Schreck, Patrick Boba, Ste...
AI
2002
Springer
15 years 26 days ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
150
Voted
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 8 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers