2899 search results - page 306 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
272
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...
174
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
153
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
161
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
169
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...