483 search results - page 45 / 97 » Linear Ranking with Reachability |
ICNP
2006
IEEE
14 years 4 months ago
2006
IEEE
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
COCO
2000
Springer
14 years 2 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
HYBRID
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we study one-clock priced timed automata in which prices can grow linearly ( ˙p = k) or exponentially ( ˙p = kp), with discontinuous updates on edges. We propose E...
FSTTCS
2005
Springer
14 years 3 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
AC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. As semiconductor technology strides towards billions of transistors on a single die, problems concerned with deep sub-micron process features and design productivity call...