9871 search results - page 126 / 1975 » On the Structure of Low Sets |
234
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
164
click to vote
SMI
2007
IEEE
16 years 19 days ago
2007
IEEE
In order to compute texture atlases with low stretch and hardly visible texture seams existing texture mapping tools pose high demands on the quality of surface representations li...
195
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
189
click to vote
DAS
2008
Springer
15 years 8 months ago
2008
Springer
In classification tasks, class-modular strategy has been widely used. It has outperformed classical strategy for pattern classification task in many applications [1]. However, in ...