Sciweavers

3946 search results - page 79 / 790
» The computational complexity of choice sets
Sort
View
IJIT
2004
15 years 1 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
UAI
2004
15 years 1 months ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
ICPR
2000
IEEE
16 years 28 days ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
PARA
1995
Springer
15 years 3 months ago
A Proposal for a Set of Parallel Basic Linear Algebra Subprograms
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS. The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
Jaeyoung Choi, Jack Dongarra, Susan Ostrouchov, An...
IAT
2005
IEEE
15 years 5 months ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen