Sciweavers

1536 search results - page 102 / 308
» Approximately Dominating Representatives
Sort
View
143
Voted
FSTTCS
2005
Springer
15 years 9 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
15 years 9 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
124
Voted
SEKE
2004
Springer
15 years 9 months ago
Supporting the Requirements Prioritization Process. A Machine Learning approach
Requirements prioritization plays a key role in the requirements engineering process, in particular with respect to critical tasks such as requirements negotiation and software re...
Paolo Avesani, Cinzia Bazzanella, Anna Perini, Ang...
IPPS
2002
IEEE
15 years 9 months ago
Fast Inductance Extraction of Large VLSI Circuits
Accurate estimation of signal delay is critical to the design and verification of VLSI circuits. At very high frequencies, signal delay in circuits with small feature sizes is do...
Hemant Mahawar, Vivek Sarin, Weiping Shi
DCC
2000
IEEE
15 years 8 months ago
Arithmetic Coding for Low Power Embedded System Design
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...
Haris Lekatsas, Wayne Wolf, Jörg Henkel