The Traveling Salesman Problem (TSP) is a very hard optimization problem in the field of operations research. It has been shown to be NP-complete, and is an often-used benchmark for new optimization techniques. One of the main challenges with this problem is that standard, non-AI heuristic approaches such as the Lin-Kernighan algorithm (LK) and the chained LK variant are currently very effectiv...

In this work, we present a spectral algorithm that finds good assignments for instances of Unique Games when the underlying graph has some significant expansion and the constraints are arbitrary Γ-max-lin. We first analyze the behavior of the SDP by Feige and Lovász [FL92] on random instances of unique games. We show that on random d-regular graphs with permutations chosen at random, the value ...

ABSTRACT The evolutionarily conserved LIN-2 (CASK)/LIN-7 (Lin7A-C)/LIN-10 (APBA1) complex plays an important role in regulating spatial organization of membrane proteins and signaling components. In Caenorhabditis elegans, the is essential for development vulva by promoting localization sole Epidermal growth factor receptor (EGFR) ortholog LET-23 to basolateral precursor cells where it can spec...

The heterochronic gene lin-28 of the nematode Caenorhabditis elegans controls the relative timing of diverse developmental events during the animal's larval stages. lin-28 is stage-specifically regulated by two genetic circuits: negatively by the 22-nt RNA lin-4 and positively by the heterochronic gene lin-14. Here, we show that lin-28 is repressed during normal development by a mechanism that ...

In this paper, a quantum neuro-fuzzy classifier (QNFC) for classification applications is proposed. The proposed QNFC model is a five-layer structure, which combines the compensatory-based fuzzy reasoning method with the traditional Takagi–Sugeno–Kang (TSK) fuzzy model. The compensatory-based fuzzy reasoning method uses adaptive fuzzy operations of neuro-fuzzy systems that can make the fuzzy lo...

A new mapping heuristic is developed, based on the recently proposed Mean Field Annealing (MFA) algorithm. An eecient implementation scheme, which decreases the complexity of the proposed algorithm by asymptotical factors, is also given. Performance of the proposed MFA algorithm is evaluated in comparison with two well-known heuristics; Simulated Annealing and Kernighan-Lin. Results of the expe...

A parallel approach for solving a large-scale Euclidean Traveling Salesman Problem (TSP) is presented. The approach consists of the following stages: partitioning the input data set into clusters, solving the TSP for each cluster to get partial solutions, merging the partial solutions to form a complete solution, and optimizing the complete solution. Lin-Kernighan-Helsgaun (LKH) algorithm is us...