Search
Now showing items 181-190 of 219
Fast wavelet transform in motor unit action potential analysis
(Publ by IEEE, 1993)
Wavelet analysis is a new method for analyzing time and frequency contents of signals. We present the Fast Wavelet Transform (FWT) implemented using B-wavelets and non-circular convolutions in the analysis of Motor Unit ...
Data management for mobile computing
(Kluwer Academic, 1998)
On computing logic programs
(1996)
In this paper we present and compare some classical problem-solving methods for computing the stable models of logic programs with negation. Using a graph theoretic representation of logic programs and their stable models, ...
Learning non-monotonic logic programs: Learning exceptions
(1995)
In this paper we present a framework for learning non-monotonic logic programs. The method is parametric on a classical learning algorithm whose generated rules are to be understood as default rules. This means that these ...
Preferred arguments are harder to compute than stable extensions
(1999)
Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...
Encoding planning problems in nonmonotonic logic programs
(1997)
We present a framework for encoding planning problems in logic programs with negation as failure, having computational efficiency as our major consideration. In order to accomplish our goal, we bring together ideas from ...
Performance study of cosmological simulations on message-passing and shared-memory multiprocessors
(ACM, 1996)
In this paper we describe PKDGRAV, a parallel hierarchical tree-structured code used to conduct cosmological simulations on shared-memory and message-passing multiprocessors. We explore performance traits of cosmological ...
FAST: a functional algorithm simulation testbed
(Publ by IEEE, 1994)
In this paper we extend the practical range of simulations of parallel executions by what we call 'functional algorithm simulation,' that is, simulation without actually performing most of the numerical computations involved. ...
Comparison of tree and straight-line clocking for long systolic arrays
(Publ by IEEE, 1991)
Achieving efficient and reliable synchronization is a critical problem in building long systolic arrays. This problem is addressed in the context of synchronous systems by introducing probabilistic models for two alternative ...