2944 search results - page 274 / 589 » Improving Bound Propagation |
157
click to vote
FORMATS
2007
Springer
16 years 25 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
166
click to vote
STACS
2007
Springer
16 years 23 days ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
175
click to vote
COMPGEOM
2006
ACM
16 years 19 days ago
2006
ACM
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
150
click to vote
PODC
2005
ACM
16 years 6 days ago
2005
ACM
— We consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum...
173
click to vote
GD
2004
Springer
16 years 1 days ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...