804 search results - page 37 / 161 » On the Termination of the Chase Algorithm |
88
Voted
JAL
2002
15 years 4 days ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
99
Voted
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
110
click to vote
CL
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
90
Voted
CORR
2010
Springer
15 years 16 days ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
99
Voted
IPL
2006
15 years 13 days ago
2006
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...