Sciweavers

466 search results - page 8 / 94
» Representation and Computation of Boolean Combinations of Sc...
Sort
View
75
Voted
JOBIM
2000
15 years 1 months ago
Can We Have Confidence in a Tree Representation?
Abstract. A tree representation distance method, applied to any dissimilarity array, always gives a valued tree, even if the tree model is not appropriate. In the first part, we pr...
Alain Guénoche, Henri Garreta
71
Voted
CPAIOR
2008
Springer
14 years 11 months ago
Efficient Haplotype Inference with Combined CP and OR Techniques
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
Ana Graça, João Marques-Silva, In&ec...
LPAR
2001
Springer
15 years 1 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
84
Voted
CGA
2007
14 years 9 months ago
From Abstract Painting to Information Visualization
abstract painting and practice can benefit information visualization—even though the two fields have significantly different objectives. This comparison reflects the spirit of ...
Kang Zhang
AI
2008
Springer
14 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar