19 search results - page 3 / 4 » An improved method for automatically searching near-optimal ... |
FLAIRS
2004
13 years 7 months ago
2004
This study borrowed sequence analysis techniques from the genetic sciences and applied them to a similar problem in email filtering and web searching. Genre identification is the ...
TAINN
2005
Springer
13 years 11 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...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
RECOMB
2003
Springer
14 years 5 months ago
2003
Springer
We describe a novel method for detecting the domain structure of a protein from sequence information alone. The method is based on analyzing multiple sequence alignments that are ...
MEDINFO
2007
13 years 7 months ago
2007
PROBLEM: Automatic keyword assignment has been largely studied in medical informatics in the context of the MEDLINE database, both for helping search in MEDLINE and in order to pr...