Search
Now showing items 201-210 of 219
Database system for thalassemia mutations
(Publ by IEEE, 1993)
In this study, a computer aided database system for handling thalassemia mutations data is presented. The system was developed in Clipper and is able to process data in the form of biochemical and molecular measurements, ...
Analyzing the workload of scientific visualization tools: A preliminary study on TIPSY
(IEEE, 1997)
Theoretical Image Processing SYstem (TIPSY) is a portable, client-server, interactive package for visualization and analysis of astrophysics and astronomy simulations. The workload characteristics of this interactive ...
Functional algorithm simulation of the fast multipole method: Architectural implications
(1996)
Functional Algorithm Simulation in a methodology for predicting the computation and communication characteristics of parallel algorithms for a class of scientific problems, without actually performing the expensive numerical ...
Portable parallel implementation of two novel mathematical biology algorithms in ZPL
(ACM, 1995)
This paper shows that mathematical models of biological pattern formation are ideally suited to data parallelism. We present two new algorithms, one for simulating the dynamic structure of fibroblasts, and the other for ...
A comparison study of heuristics for mapping parallel algorithms to message-passing multiprocessors
(1995)
This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which arc representative of ...
Comparison of tree and straight-line clocking for long systolic arrays
(1991)
A critical problem in building long systolic arrays lies in efficient and reliable synchronization. We address this problem in the context of synchronous systems by introducing probabilistic models for two alternative clock ...
Classical methods in nonmonotonic reasoning
(1994)
In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
The computational value of joint consistency
(1994)
In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
Integrating explanatory and descriptive learning in ILP
(1997)
A learning framework that combines the two frameworks of explanatory and descriptive Inductive Logic Programming (ILP) is presented. The induced hypotheses in this framework are pairs of the form (T, IC) where T is a ...
On the semantics of inheritance networks
(1992)
A semantics for inheritance reasoning is presented which allows both strict and defeasible knowledge to be represented. The approach proposed considers the semantics as consisting of two parts: the content theory which ...