16666 search results - page 86 / 3334 » Descriptive and Computational Complexity |
149
Voted
ICNC
2005
Springer
15 years 9 months ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
125
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
118
Voted
SUTC
2006
IEEE
15 years 9 months ago
2006
IEEE
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
116
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
114
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...