10988 search results - page 1672 / 2198 » Algorithmic Folding Complexity |
170
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
187
click to vote
AAAI
2006
15 years 8 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
210
click to vote
AAAI
2006
15 years 8 months ago
2006
hibition: Extended Abstract Social insects, such as ants and termites, collectively build large and complex structures, with many individuals following simple rules and no centrali...
198
click to vote
AAAI
1998
15 years 8 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
214
click to vote
AAAI
1996
15 years 8 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...