920 search results - page 184 / 184 » Generating Satisfiable Problem Instances |
BMCBI
2005
13 years 4 months ago
2005
Background: Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterp...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
ML
2010
ACM
13 years 3 months ago
2010
ACM
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
ICDE
2010
IEEE
13 years 2 months ago
2010
IEEE
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Publication
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...