5230 search results - page 356 / 1046 » Dynamic Optimality -- Almost |
162
click to vote
ISPD
1997
ACM
15 years 11 months ago
1997
ACM
In this paper, we present a new approach that performs timing driven placement for standard cell circuits in interaction with netlist transformations. As netlist transformations a...
175
Voted
DAS
2010
Springer
15 years 11 months ago
2010
Springer
Most of the Indian scripts do not have any robust commercial OCRs. Many of the laboratory prototypes report reasonable results at recognition/classification stage. However, word ...
167
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
197
Voted
DAGM
2006
Springer
15 years 10 months ago
2006
Springer
In real world scenes, objects to be classified are usually not visible from every direction, since they are almost always positioned on some kind of opaque plane. When moving a cam...
195
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...