2080 search results - page 228 / 416 » Measuring empirical computational complexity |
151
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a subspace learning method, called Local Discriminant Embedding with Tensor representation (LDET), that addresses simultaneously the generalization and data representat...
165
click to vote
ECSQARU
2009
Springer
16 years 15 days ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
190
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
155
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
162
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is an evolutionary algorithm for continuous vector-valued optimization. It combines indicator-based...