2989 search results - page 61 / 598 » Using Domain-Independent Problems for Introducing Formal Met... |
KI
1999
Springer
15 years 2 months ago
1999
Springer
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
AMC
2005
14 years 9 months ago
2005
In this study wavelet based high-order Taylor Galerkin methods is introduced. Additional time layers are used to obtain high-order temporal accuracy unattainable within a two-step...
RECOMB
2008
Springer
15 years 10 months ago
2008
Springer
A key problem of interest to biologists and medical researchers is the selection of a subset of queries or treatments that provide maximum utility for a population of targets. For ...
124
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...