804 search results - page 36 / 161 » On the Termination of the Chase Algorithm |
100
Voted
ECOOP
2005
Springer
15 years 6 months ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
105
Voted
AAECC
2007
Springer
15 years 18 days ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
122
click to vote
ALGORITHMICA
2006
15 years 15 days ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
75
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
104
Voted
PIMRC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--This paper addresses the fairness of Medium Access Control (MAC) protocols that are capable of handling interference on the physical layer to a varying extent. The variat...