2884 search results - page 263 / 577 » Evaluating learning algorithms and classifiers |
143
Voted
ML
2006
ACM
15 years 3 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
132
click to vote
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
133
Voted
BMCBI
2005
15 years 3 months ago
2005
In task 1A of the BioCreAtIvE evaluation, systems had to be devised that recognize words and phrases forming gene or protein names in natural language sentences. We approach this ...
129
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
135
Voted
PR
2008
15 years 3 months ago
2008
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...