Sciweavers

9842 search results - page 1821 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
FIMH
2005
Springer
14 years 3 months ago
Fast Spatio-temporal Free-Form Registration of Cardiac MR Image Sequences
Abstract. In this paper we present a novel approach to the problem of spatiotemporal alignment of cardiac MR image sequences. This novel method has the ability to correct spatial m...
Dimitrios Perperidis, Raad Mohiaddin, Daniel Rueck...
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
14 years 3 months ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong
GD
2005
Springer
14 years 3 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
14 years 3 months ago
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
Gregory Hornby
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
14 years 3 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
« Prev « First page 1821 / 1969 Last » Next »