804 search results - page 113 / 161 » On the Termination of the Chase Algorithm |
107
click to vote
TACAS
2000
Springer
15 years 4 months ago
2000
Springer
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
STOC
1995
ACM
15 years 4 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
104
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
91
Voted
FUIN
2007
15 years 19 days ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
111
Voted
ENTCS
2002
15 years 14 days ago
2002
The perceived advantages of distributed systems, such as increased reliability and availability, are o set by the increased complexity of developing such applications. The develop...