3155 search results - page 110 / 631 » An algorithm for optimal difference systems of sets |
124
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
173
Voted
JMLR
2012
13 years 6 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
146
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
139
click to vote
ICRA
2009
IEEE
15 years 1 months ago
2009
IEEE
We present a novel method for prioritizing both linear equality and inequality systems and provide one algorithm for its resolution. This algorithm can be summarized as a sequence ...
149
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...