Sciweavers

2381 search results - page 4 / 477
» Take Advantage of the Computing Power of DNA Computers
Sort
View
MEMBRANE
2005
Springer
14 years 25 days ago
Boolean Circuits and a DNA Algorithm in Membrane Computing
In the present paper we propose a way to simulate Boolean gates and circuits in the framework of P systems with active membranes using inhibiting/de-inhibiting rules. This new appr...
Mihai Ionescu, Tseren-Onolt Ishdorj
DAC
2004
ACM
14 years 8 months ago
Worst-case circuit delay taking into account power supply variations
Current Static Timing Analysis (STA) techniques allow one to verify the timing of a circuit at different process corners which only consider cases where all the supplies are low o...
Dionysios Kouroussis, Rubil Ahmadi, Farid N. Najm
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 7 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
13 years 12 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 26 days ago
The evolutionary computation approach to motif discovery in biological sequences
Finding motifs — patterns of conserved residues — within nucleotide and protein sequences is a key part of understanding function and regulation within biological systems. Thi...
Michael A. Lones, Andrew M. Tyrrell