Sciweavers

266 search results - page 26 / 54
» Is Combining Classifiers Better than Selecting the Best One
Sort
View
102
Voted
RECOMB
2009
Springer
15 years 4 months ago
Protein Fragment Swapping: A Method for Asymmetric, Selective Site-Directed Recombination
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
Wei Zheng, Karl E. Griswold, Chris Bailey-Kellogg
DA
2010
123views more  DA 2010»
14 years 6 months ago
Paradoxes in Learning and the Marginal Value of Information
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
Peter Frazier, Warren B. Powell
CSL
2008
Springer
14 years 11 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
ACG
2006
Springer
15 years 1 months ago
Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons
Amazons is a two-player perfect information game with a high branching factor, particularly in the opening. Therefore, improving the efficiency of the search is important for impro...
Yoshinori Higashiuchi, Reijer Grimbergen
PR
2008
120views more  PR 2008»
14 years 9 months ago
Fuzzy integral based information fusion for classification of highly confusable non-speech sounds
Acoustic event classification may help to describe acoustic scenes and contribute to improve the robustness of speech technologies. In this work, fusion of different information s...
Andrey Temko, Dusan Macho, Climent Nadeu