Sciweavers

5722 search results - page 1128 / 1145
» Security Function Interactions
Sort
View
BMCBI
2007
216views more  BMCBI 2007»
13 years 8 months ago
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
Chris Thachuk, Alena Shmygelska, Holger H. Hoos
BMCBI
2007
98views more  BMCBI 2007»
13 years 8 months ago
Duration learning for analysis of nanopore ionic current blockades
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties, with potential implications ...
Alexander G. Churbanov, Carl Baribault, Stephen Wi...
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 8 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
ISCI
2008
159views more  ISCI 2008»
13 years 8 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao
IJFCS
2006
130views more  IJFCS 2006»
13 years 8 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
« Prev « First page 1128 / 1145 Last » Next »