Sciweavers

1094 search results - page 169 / 219
» On Computing Explanations in Argumentation
Sort
View
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 3 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
RTA
2004
Springer
14 years 3 months ago
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
Salvador Lucas
COMPGEOM
1999
ACM
14 years 2 months ago
Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space
Several motion planning methods using networks of randomly generated nodes in the free space have been shown to perform well in a number of cases, however their performance degrad...
Steven A. Wilmarth, Nancy M. Amato, Peter F. Still...
ICPPW
1999
IEEE
14 years 2 months ago
An Analysis of the Number of ICP Packets on the Distributed WWW Caching System
A distributed WWW caching system based on Internet Cache Protocol (ICP) is a system where a cache of a single proxy server is shared by others. When a proxy server receives an HTT...
Eiji Kawai, Ken-ichi Chinen, Suguru Yamaguchi, Hid...
COCOON
1999
Springer
14 years 2 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman