Sciweavers

541 search results - page 49 / 109
» Factoring Solution Sets of Polynomial Systems in Parallel
Sort
View
INFOCOM
2000
IEEE
15 years 4 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
EDOC
2008
IEEE
15 years 11 hour ago
A Tactic-Based Approach to Embodying Non-functional Requirements into Software Architectures
This paper presents an approach for embodying nonfunctional requirements (NFRs) into software architecture using architectural tactics. Architectural tactics are reusable architec...
Suntae Kim, Dae-Kyoo Kim, Lunjin Lu, Sooyong Park
IEEEPACT
2006
IEEE
15 years 5 months ago
A low-cost memory remapping scheme for address bus protection
The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program. This can lead to critical information leakage such as encryp...
Lan Gao, Jun Yang 0002, Marek Chrobak, Youtao Zhan...
INFOCOM
2002
IEEE
15 years 4 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
JCO
2011
115views more  JCO 2011»
14 years 6 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu