4488 search results - page 540 / 898 » Properties of NP-Complete Sets |
197
click to vote
ICECCS
1999
IEEE
15 years 12 months ago
1999
IEEE
Configuring and deploying a large software system is complicated when the system is composed of components and when there are numerous possible configurations for the system. In s...
179
click to vote
APN
1999
Springer
15 years 12 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
207
click to vote
DAWAK
1999
Springer
15 years 12 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
214
click to vote
FCT
1999
Springer
15 years 11 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...
250
click to vote
FOSSACS
1999
Springer
15 years 11 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...