Sciweavers

6095 search results - page 204 / 1219
» Learning in Local Search
Sort
View
131
Voted
JCO
2007
123views more  JCO 2007»
15 years 2 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
115
Voted
IJON
2007
131views more  IJON 2007»
15 years 2 months ago
Margin-based active learning for LVQ networks
In this article, we extend a local prototype-based learning model by active learning, which gives the learner the capability to select training samples and thereby increase speed a...
Frank-Michael Schleif, Barbara Hammer, Thomas Vill...
155
Voted
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 3 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
113
Voted
IPPS
1999
IEEE
15 years 6 months ago
Regularity Considerations in Instance-Based Locality Optimization
Instance based locality optimization 6 is a semi automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of consideri...
Claudia Leopold
140
Voted
ATAL
2007
Springer
15 years 8 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee