Sciweavers

3049 search results - page 256 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
IWQOS
2004
Springer
15 years 12 months ago
Towards content distribution networks with latency guarantees
This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with dif...
Chengdu Huang, Tarek F. Abdelzaher
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 10 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
SODA
2008
ACM
70views Algorithms» more  SODA 2008»
15 years 8 months ago
Optimal universal graphs with deterministic embedding
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
Noga Alon, Michael R. Capalbo
ICDCS
2005
IEEE
16 years 5 days ago
Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...
Rodrigo Schmidt, Islene C. Garcia, Fernando Pedone...
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 6 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari