2244 search results - page 288 / 449 » A new heuristic approach for non-convex optimization problem... |
239
Voted
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
193
click to vote
ML
1998
ACM
15 years 6 months ago
1998
ACM
Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithmshave appeared that approximatedynamic programming on an ...
197
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
180
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
214
click to vote
GECCO
2010
Springer
15 years 12 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...