6102 search results - page 397 / 1221 » Generating Optimizing Specializers |
105
click to vote
ICA
2004
Springer
15 years 9 months ago
2004
Springer
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
113
click to vote
SBIA
2004
Springer
15 years 9 months ago
2004
Springer
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
132
click to vote
FAW
2009
Springer
15 years 8 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
139
click to vote
CAV
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
122
click to vote
EMO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract The performance of stochastic optimisers can be assessed experimentally on given problems by performing multiple optimisation runs, and analysing the results. Since an opt...