Sciweavers

340 search results - page 1 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
ISAAC
2003
Springer
134views Algorithms» more  ISAAC 2003»
13 years 10 months ago
New Ways to Construct Binary Search Trees
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
Travis Gagie
TCAD
2002
110views more  TCAD 2002»
13 years 5 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
PR
2007
111views more  PR 2007»
13 years 4 months ago
Design and formal proof of a new optimal image segmentation program with hypermaps
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an opt...
Jean-François Dufourd
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
13 years 3 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young