373 search results - page 19 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
JAIR
2007
13 years 8 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
BMCBI
2005
13 years 8 months ago
2005
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...