This paper illustrates how large instances of the unconstrained task allocation problem can be effectively modeled and efficiently solved as unconstrained quadratic binary programs. Computational experience and a comparison to the state-ofthe-art commercial code (CPLEX) illustrate the attractiveness
Using DNA to solve the Bounded Post Correspondence Problem
โ Scribed by Lila Kari; Greg Gloor; Sheng Yu
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 121 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
โฆ Synopsis
Theoretical research in DNA computing includes designing practical experiments for solving various computational problems by means of DNA manipulation. This paper proposes a DNA algorithm for an NP-complete problem, The Bounded Post Correspondence Problem. The proposed experiment can be used to test several standard molecular biology laboratory procedures for their usability as bio-operations in DNA computing.
๐ SIMILAR VOLUMES
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed. The effectiveness of the proposed approach on large graphs with large independence number is demonstrated
In this paper, a new solution of the vectormaximum problem will be defined in terms of fuzq mathematics and may be called the fuzzy solution. It will overcome difficulties which appear if otherwise solved by nonfuzzy mathematics. In this paper, the relation between this solution and the important co
We present a survey of the most significant techniques, used in the last few years, concerning the coded structured light methods employed to get 3D information. In fact, depth perception is one of the most important subjects in computer vision. Stereovision is an attractive and widely used method,