5331 search results - page 299 / 1067 » Algebraic Methods for Optimization Problems |
211
click to vote
JGO
2010
15 years 5 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
219
click to vote
AAAI
2011
14 years 6 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
198
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
199
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
160
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...