Sciweavers

427 search results - page 66 / 86
» A Subexponential Bound for Linear Programming
Sort
View
ICSOC
2010
Springer
13 years 7 months ago
Adaptive Management of Composite Services under Percentile-Based Service Level Agreements
We present a brokering service for the adaptive management of composite services. The goal of this broker is to dynamically adapt at runtime the composite service configuration, ...
Valeria Cardellini, Emiliano Casalicchio, Vincenzo...
VLSID
2007
IEEE
126views VLSI» more  VLSID 2007»
14 years 9 months ago
An ECO Technique for Removing Crosstalk Violations in Clock Networks
Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix cros...
Amit Kumar, Krishnendu Chakrabarty, Chunduri Rama ...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 3 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
GLOBECOM
2008
IEEE
14 years 3 months ago
Global Optimal Routing, Scheduling and Power Control for Multi-Hop Wireless Networks with Interference
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
Javad Kazemitabar, Vahid Tabatabaee, Hamid Jafarkh...
ICALP
2005
Springer
14 years 2 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz