1883 search results - page 263 / 377 » Ordered theta graphs |
FMCAD
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
FOSSACS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
ASPDAC
2001
ACM
14 years 1 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
ISAAC
1995
Springer
14 years 1 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
FOCS
1994
IEEE
14 years 1 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...