12194 search results - page 244 / 2439 » Numberings Optimal for Learning |
184
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
119
click to vote
ASPLOS
2006
ACM
16 years 16 days ago
2006
ACM
Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at ex...
172
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
189
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
183
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...