Sciweavers

9572 search results - page 132 / 1915
» Cover Algorithms and Their Combination
Sort
View
DFT
2005
IEEE
103views VLSI» more  DFT 2005»
15 years 10 months ago
Methodologies and Algorithms for Testing Switch-Based NoC Interconnects
In this paper, we present two novel methodologies for testing the interconnect fabrics of network-on-chip (NoC) based chips. Both use the concept of recursive testing, with differ...
Cristian Grecu, Partha Pratim Pande, Baosheng Wang...
167
Voted
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
15 years 8 months ago
Spectral Multiscale Coverage: A uniform coverage algorithm for mobile sensor networks
Abstract— In this paper we propose centralized feedback control laws for mobile sensor networks so that sensor trajectories cover a given domain as uniformly as possible. The des...
George Mathew, Igor Mezic
EOR
2010
140views more  EOR 2010»
15 years 2 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
16 years 2 months ago
Gate sizing using Lagrangian relaxation combined with a fast gradient-based pre-processing step
─ In this paper, we present Forge, an optimal algorithm for gate sizing using the Elmore delay model. The algorithm utilizes Lagrangian relaxation with a fast gradient-based pre-...
Hiran Tennakoon, Carl Sechen
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 8 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay