Sciweavers

4940 search results - page 711 / 988
» On the Complexity of Universal Programs
Sort
View
ETS
2010
IEEE
174views Hardware» more  ETS 2010»
15 years 7 months ago
Test-architecture optimization for TSV-based 3D stacked ICs
Testing of 3D stacked ICs (SICs) is becoming increasingly important in the semiconductor industry. In this paper, we address the problem of test architecture optimization for 3D s...
Brandon Noia, Sandeep Kumar Goel, Krishnendu Chakr...
ICASSP
2010
IEEE
15 years 6 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
COR
2008
111views more  COR 2008»
15 years 6 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
CSI
2007
86views more  CSI 2007»
15 years 6 months ago
Using UML to model relational database operations
The Unified Modeling Language (UML) is being used as the de-facto standard in the software industry. With the adoption of UML 2.0, the new enhancements allow this version to desc...
Eunjee Song, Shuxin Yin, Indrakshi Ray
CCR
2004
151views more  CCR 2004»
15 years 6 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster