4666 search results - page 639 / 934 » Equations on Timed Languages |
171
click to vote
ICALP
2010
Springer
16 years 6 days ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
220
click to vote
PLDI
2009
ACM
16 years 2 days ago
2009
ACM
Dynamic information flow policies, such as declassification, are essential for practically useful information flow control systems. However, most systems proposed to date that ...
191
click to vote
ICALP
2001
Springer
15 years 12 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
202
click to vote
ICALP
2001
Springer
15 years 12 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
180
click to vote
ICALP
2001
Springer
15 years 12 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...