102 search results - page 5 / 21 » On the Complexity of Boolean Functions in Different Characte... |
105
Voted
COCO
2001
Springer
15 years 4 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
113
Voted
ICCAD
2009
IEEE
14 years 9 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
113
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Implementations of parallel dialects (or: coordination languages) on a functional base (or: computation) language always have to extend complex runtime environments by th...
101
Voted
SIAMSC
2008
14 years 11 months ago
2008
Here we develop an option pricing method for European options based on the Fourier-cosine series, and call it the COS method. The key insight is in the close relation of the charac...