534 search results - page 58 / 107 » Proving Termination of Rewrite Systems Using Bounds |
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
OSDI
1996
ACM
13 years 9 months ago
1996
ACM
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
IJFCS
2008
13 years 7 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
ISCC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET–cell) to acces...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Long running decision support queries can be resource intensive and often lead to resource contention in data warehousing systems. Today, the only real option available to the DBA...