6562 search results - page 379 / 1313 » Noetherianity and Combination Problems |
156
Voted
NIPS
2008
15 years 8 months ago
2008
We study the behavior of block 1/ 2 regularization for multivariate regression, where a K-dimensional response vector is regressed upon a fixed set of p covariates. The problem of...
197
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
190
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
176
click to vote
FLAIRS
2004
15 years 8 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
179
click to vote
ECAI
2010
Springer
15 years 8 months ago
2010
Springer
A Markov Decision Process (MDP) is a general model for solving planning problems under uncertainty. It has been extended to multiobjective MDP to address multicriteria or multiagen...