804 search results - page 27 / 161 » On the Termination of the Chase Algorithm |
ICMAS
2000
15 years 3 months ago
2000
In a distributed multiagent negotiation involving multiple issues, it is often desirable to finalize dealsonly whenall related issues are resolved. Wepresent a quiescence detectio...
122
click to vote
FUIN
2006
15 years 1 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
104
click to vote
WSC
2001
15 years 3 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
108
click to vote
SODA
1990
ACM
15 years 3 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
116
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...