3082 search results - page 272 / 617 » New Bounds for the Controller Problem |
155
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
156
click to vote
QEST
2006
IEEE
16 years 20 days ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
170
click to vote
WADS
2005
Springer
16 years 3 days ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
188
click to vote
ESA
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
152
Voted
RTSS
2009
IEEE
16 years 1 months ago
2009
IEEE
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...