Sciweavers

373 search results - page 15 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
JMLR
2010
194views more  JMLR 2010»
13 years 1 months ago
A Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large...
Elham Salehi, Jayashree Nyayachavadi, Robin Gras
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins
Background: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such...
Pantelis G. Bagos, Theodore D. Liakopoulos, Stavro...
FUN
2010
Springer
254views Algorithms» more  FUN 2010»
13 years 12 months ago
The Urinal Problem
Abstract. A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance ...
Evangelos Kranakis, Danny Krizanc
FOCS
2005
IEEE
14 years 21 days ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys
DAGSTUHL
2007
13 years 8 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys