Sciweavers

925 search results - page 57 / 185
» A Solution to the Extended GCD Problem
Sort
View
LATA
2010
Springer
14 years 5 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta
RTA
2007
Springer
14 years 1 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
ICALP
2000
Springer
13 years 11 months ago
Computing the Girth of a Planar Graph
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
Hristo Djidjev
FORTE
2007
13 years 9 months ago
Event Correlation with Boxed Pomsets
This paper proposes a diagnosis framework for distributed systems based on pomset languages. Diagnosis is performed by projecting these models on a collection of observable labels ...
Thomas Gazagnaire, Loïc Hélouët