10988 search results - page 347 / 2198 » Algorithmic Folding Complexity |
141
click to vote
ICAISC
2010
Springer
15 years 9 months ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
141
click to vote
ISSAC
1998
Springer
15 years 9 months ago
1998
Springer
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
126
click to vote
DAC
1996
ACM
15 years 9 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
148
click to vote
TNN
1998
15 years 4 months ago
1998
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
149
click to vote
ICCD
2004
IEEE
16 years 1 months ago
2004
IEEE
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...