866 search results - page 38 / 174 » Extension of the direct optimization algorithm for noisy fun... |
MOR
2002
13 years 7 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
MP
1998
13 years 7 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
PRL
2008
13 years 6 months ago
2008
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
JMLR
2008
13 years 7 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...