8486 search results - page 15 / 1698 » Ordered Enumeration Method |
DAC
1996
ACM
13 years 11 months ago
1996
ACM
-- This paper presents an efficient method for the timing verification of concurrent systems, modeled as labeled Timed Petri nets. The verification problems we consider require us ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface Σ and introduce the number CΣ(n) of noncrossing pa...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
SIGMOD
2000
ACM
13 years 12 months ago
2000
ACM
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
COMBINATORICS
2000
13 years 7 months ago
2000
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...