[HTML][HTML] Nanotechnology and computer science: Trends and advances
Nanotechnology is the aptitude to perceive, measure, operate, and build materials at the
nanometer scale, the size of atoms and molecules. Nanotechnology, is involved in many …
nanometer scale, the size of atoms and molecules. Nanotechnology, is involved in many …
Nature–inspired intelligence: a review of selected methods and applications
V Vassiliadis, G Dounias - International Journal on Artificial …, 2009 - World Scientific
The successful handling of numerous real–world complex problems has increased the
popularity of nature–inspired intelligent (NII) algorithms and techniques. Their successful …
popularity of nature–inspired intelligent (NII) algorithms and techniques. Their successful …
Quantum algorithms and mathematical formulations of biomolecular solutions of the vertex cover problem in the finite-dimensional hilbert space
WL Chang, TT Ren, M Feng - IEEE transactions on …, 2014 - ieeexplore.ieee.org
In this paper, it is shown that the proposed quantum algorithm for implementing Boolean
circuits generated from the DNA-based algorithm solving the vertex-cover problem of any …
circuits generated from the DNA-based algorithm solving the vertex-cover problem of any …
Focusing requirements elicitation by using a UX measurement method
K Ohashi, A Katayama, N Hasegawa… - 2018 IEEE 26th …, 2018 - ieeexplore.ieee.org
Many User Experience (UX) activities are carried out during requirements engineering
phases, eg understanding and assessing the UX of existing systems, and eliciting functional …
phases, eg understanding and assessing the UX of existing systems, and eliciting functional …
Fast parallel DNA-based algorithms for molecular computation: The set-partition problem
WL Chang - IEEE Transactions on Nanobioscience, 2007 - ieeexplore.ieee.org
This paper demonstrates that basic biological operations can be used to solve the set-
partition problem. In order to achieve this, we propose three DNA-based algorithms, a …
partition problem. In order to achieve this, we propose three DNA-based algorithms, a …
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm
WL Chang, SC Huang, KW Lin, M Ho - The Journal of Supercomputing, 2011 - Springer
Abstract Diffie and Hellman (IEEE Trans. Inf. Theory 22 (6): 644–654, 1976) wrote the paper
in which the concept of a trapdoor one-way function was first proposed. The Diffie–Hellman …
in which the concept of a trapdoor one-way function was first proposed. The Diffie–Hellman …
A new light-based solution to the Hamiltonian path problem
JS Sartakhti, S Jalili, AG Rudi - Future Generation Computer Systems, 2013 - Elsevier
The exponential running time for algorithms designed to solve NP-complete problems in
conventional computers, mostly, makes it almost impossible solving large instances of such …
conventional computers, mostly, makes it almost impossible solving large instances of such …
Biological computation of the solution to the quadratic assignment problem
Biological computing provides a promising approach to attacking computationally intractable
problems. The quadratic assignment problem (QAP) is a well-known NP-hard combinatorial …
problems. The quadratic assignment problem (QAP) is a well-known NP-hard combinatorial …
The Air Force computer program acquisition concept
MV Ratynski - Proceedings of the April 18-20, 1967, spring joint …, 1967 - dl.acm.org
The classic approach to the development of Air Force operational computer programs has
been to award separate contracts for the hardware and for the" software" aspects of an …
been to award separate contracts for the hardware and for the" software" aspects of an …
A molecular solution to the hitting-set problem in DNA-based supercomputing
NY Shi, CP Chu - Information Sciences, 2010 - Elsevier
Assume that there exists a collection C of subsets of a finite set S, and a positive integer
K⩽∣ S∣, and we need to know whether there is a subset S′⊆ S with∣ S′∣⩽ K such …
K⩽∣ S∣, and we need to know whether there is a subset S′⊆ S with∣ S′∣⩽ K such …