450 search results - page 47 / 90 » Estimating Search Tree Size |
ICCAD
2008
IEEE
14 years 5 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
COR
2011
13 years 3 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
ICIP
1994
IEEE
14 years 10 months ago
1994
IEEE
A new motion estimation scheme, Discrete-Cosine/SineTransform Based Motion Estimation (DXT-ME) utilizing the principle of orthogonality of cosine and sine functions to estimate, i...
DSD
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we present an efficient hardware architecture for real-time implementation of quarter-pixel accurate variable block size motion estimation for H.264 / MPEG4 Part 10...