Sciweavers

4190 search results - page 3 / 838
» The Cost of Design
Sort
View
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
13 years 12 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
DATE
2009
IEEE
93views Hardware» more  DATE 2009»
14 years 3 days ago
Test cost reduction for multiple-voltage designs with bridge defects through Gate-Sizing
Abstract—Multiple-voltage is an effective dynamic power reduction design technique. Recent research has shown that testing for resistive bridging faults in such designs requires ...
S. Saqib Khursheed, Bashir M. Al-Hashimi, Peter Ha...
FOCS
2008
IEEE
13 years 11 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 5 months ago
QoX-driven ETL design: reducing the cost of ETL consulting engagements
As business intelligence becomes increasingly essential for organizations and as it evolves from strategic to operational, the complexity of Extract-Transform-Load (ETL) processes...
Alkis Simitsis, Kevin Wilkinson, Malú Caste...
DCC
2006
IEEE
13 years 9 months ago
Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
Sorina Dumitrescu