Sciweavers

82 search results - page 11 / 17
» ab 2007
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
13 years 9 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
IJCAI
1993
13 years 11 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz
ARITH
2007
IEEE
14 years 4 months ago
Modular Multiplication using Redundant Digit Division
Most implementations of the modular exponentiation, ME mod N, computation in cryptographic algorithms employ Montgomery multiplication, ABR−1 mod N, instead of modular multiplic...
Ping Tak Peter Tang
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 4 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
ENTCS
2007
158views more  ENTCS 2007»
13 years 9 months ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer