7519 search results - page 1026 / 1504 » Optimizing Generic Functions |
181
click to vote
ISBI
2007
IEEE
16 years 1 months ago
2007
IEEE
Several recent studies have shown that fluorescent particles can be localized with an accuracy that is well beyond traditional resolution limits. Using a theoretical model of the...
163
click to vote
CC
2007
Springer
16 years 1 months ago
2007
Springer
To achieve high resource utilization for multi-issue Digital Signal Processors (DSPs), production compilers commonly include variants of the iterative modulo scheduling algorithm. ...
187
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
170
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
173
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...