7519 search results - page 200 / 1504 » Optimizing Generic Functions |
195
click to vote
CPHYSICS
2006
15 years 6 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
144
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
293
click to vote
Publication
There are p heterogeneous objects to be assigned to n competing agents (n > p)
each with unit demand. It is required to design a Groves mechanism for this assignment problem
s...
186
click to vote
FTDCS
1997
IEEE
15 years 10 months ago
1997
IEEE
: This paper discusses the issues and promising approaches in (1) obtaining rigorous specifications of the quality-of-service (QoS) requirements associated with application functio...
