Sciweavers

230 search results - page 18 / 46
» A Linear Time Algorithm for L(2, 1)-Labeling of Trees
Sort
View
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 5 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri
HYBRID
2007
Springer
13 years 11 months ago
On Self-triggered Full-Information H-Infinity Controllers
Abstract. A self-triggered control task is one in which the task determines its next release time. It has been conjectured that self-triggering can relax the requirements on a real...
Michael D. Lemmon, Thidapat Chantem, Xiaobo Sharon...
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 5 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
IWSEC
2010
Springer
13 years 6 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo