Sciweavers

6251 search results - page 998 / 1251
» Randomness, Computability, and Density
Sort
View
WSC
2004
15 years 8 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
ISMB
1997
15 years 8 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
AAAI
1996
15 years 8 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
CIBCB
2009
IEEE
15 years 8 months ago
rnaDesign: Local search for RNA secondary structure design
Abstract-- The RNA secondary structure design (SSD) problem is a recently emerging research topic motivated by applications such as customized drug design and the self-assembly of ...
Denny C. Dai, Herbert H. Tsang, Kay C. Wiese
ICANN
2010
Springer
15 years 8 months ago
Assessing Statistical Reliability of LiNGAM via Multiscale Bootstrap
Structural equation models have been widely used to study causal relationships between continuous variables. Recently, a non-Gaussian method called LiNGAM was proposed to discover ...
Yusuke Komatsu, Shohei Shimizu, Hidetoshi Shimodai...