A Light-Based Device for Solving the Hamiltonian Path Problem

- 10 Aug 2007

TL;DR: In this paper, the authors proposed a special device which uses light rays for solving the Hamiltonian path problem on a directed graph and showed that the proposed device can solve small and medium instances of the problem in reasonable time.

Abstract: In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it following the routes given by the connections between nodes. In each node the rays are uniquely marked so that they can be easily identified. At the destination node we will search only for particular rays that have passed only once through each node. We show that the proposed device can solve small and medium instances of the problem in reasonable time.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions mentioned in the paper "The number of orbits of periodic box-ball systems" ?

The authors focus on pBBS with at most two kinds of solitons and investigate their behaviours, especially, the length of cycles and the number of orbits.. The authors showed some relational equations of soliton sizes, a box size and the number of orbits.

Citations

Journal Article•10.1016/J.ESWA.2014.12.035

Congestion control based ant colony optimization algorithm for large MIMO detection

Manish Mandloi, +1 more

- 01 May 2015

- Expert Systems With Applications

TL;DR: A congestion control based ant colony optimization (CC-ACO) algorithm for large MIMO detection is proposed and the robustness of the proposed algorithm under channel state information (CSI) estimation error is discussed.

...read moreread less

Journal Article•10.1016/J.NEUCOM.2015.01.072

The power of time-free tissue P systems

Xiangrong Liu, +4 more

- 02 Jul 2015

- Neurocomputing

TL;DR: The computational efficiency of time-free tissue P systems is considered and it is proved that the Maximum Clique Problem and Hamilton Path Problem can be solved in this way in polynomial time with respect to the size of the problems.

...read moreread less

Journal Article•10.1016/j.asoc.2023.110583

BE-GWO: Binary extremum-based grey wolf optimizer for discrete optimization problems

Mahdis Banaie-Dezfouli, +2 more

- 01 Jul 2023

- Applied Soft Computing

TL;DR: In this paper , an improved binary GWO named extremum-based GWO (BE-GWO) algorithm is introduced, which proposes a new cosine transfer function (CTF) to convert the continuous GWO to the binary form and then introduces an extremum (Ex) search strategy to improve the efficiency of converted binary solutions.

...read moreread less

Journal Article•10.1016/J.BIOSYSTEMS.2021.104447

Light sensitive Belousov-Zhabotinsky medium accommodates multiple logic gates.

Michail-Antisthenis I. Tsompanas, +4 more

- 01 Aug 2021

- BioSystems

TL;DR: In this paper, the design of multiple logic gates in a fixed BZ reservoir was investigated, and the three basic logic gates (namely NOT, OR and AND ) were studied to prove the Turing completeness of the architecture.

...read moreread less

Book Chapter•10.1007/978-3-540-74593-8_1

Encapsulating reaction-diffusion computers

Andrew Adamatzky

- 10 Sep 2007

TL;DR: This work increases applicability domain of the reaction-diffusion computers by encapsulating them in a membrane, in a form of vegetative state, plasmodium, of true slime mold, so that they can also realize Kolmogorov-Uspensky machine.

...read moreread less

References

Some methods for classification and analysis of multivariate observations

James B. MacQueen

- 01 Jan 1967

TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.

...read moreread less

28.1K

Journal Article•10.1126/SCIENCE.7973651

Molecular computation of solutions to combinatorial problems

Leonard M. Adleman

- 01 Nov 1994

- Science

TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.

...read moreread less

4.6K

•Journal Article•10.1038/17561

Light speed reduction to 17 metres per second in an ultracold atomic gas

Lene Vestergaard Hau, +6 more

- 18 Feb 1999

- Nature

TL;DR: In this paper, an experimental demonstration of electromagnetically induced transparency in an ultracold gas of sodium atoms, in which the optical pulses propagate at twenty million times slower than the speed of light in a vacuum, is presented.

...read moreread less

4.2K

•Journal Article•10.1038/NATURE03346

A continuous-wave Raman silicon laser

Haisheng Rong, +6 more

- 17 Feb 2005

- Nature

TL;DR: The demonstration of a continuous-wave silicon Raman laser is demonstrated and it is shown that TPA-induced FCA in silicon can be significantly reduced by introducing a reverse-biased p-i-n diode embedded in a silicon waveguide.

...read moreread less

1.3K

Journal Article•10.1103/PHYSREVLETT.76.3247

From soliton equations to integrable cellular automata through a limiting procedure.

Tetsuji Tokihiro, +3 more

- 29 Apr 1996

- Physical Review Letters

TL;DR: A direct connection between a cellular automaton and integrable nonlinear wave equations is shown and a general method for constructing suchintegrable cellular automata and their $N$-soliton solutions is proposed.

...read moreread less

546

...

Expand

A Light-Based Device for Solving the Hamiltonian Path Problem

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions mentioned in the paper "The number of orbits of periodic box-ball systems" ?

Figures

Citations

Congestion control based ant colony optimization algorithm for large MIMO detection

The power of time-free tissue P systems

BE-GWO: Binary extremum-based grey wolf optimizer for discrete optimization problems

Light sensitive Belousov-Zhabotinsky medium accommodates multiple logic gates.

Encapsulating reaction-diffusion computers

References

Some methods for classification and analysis of multivariate observations

Molecular computation of solutions to combinatorial problems

Light speed reduction to 17 metres per second in an ultracold atomic gas

A continuous-wave Raman silicon laser

From soliton equations to integrable cellular automata through a limiting procedure.

Related Papers (5)

A light-based device for solving the hamiltonian path problem

Solving the subset-sum problem with a light-based device

A Fully Dynamic Data Structure for Reachability in Planar Digraphs

Approximation algorithms and hardness results for shortest path based graph orientations

Network orientation via shortest paths