Results 61 to 70 of about 15,296 (207)

In‐Memory Euclidean Distance Computation in a Stacked Memristor Crossbar for Hardware Self‐Organizing Maps

open access: yesAdvanced Functional Materials, Volume 36, Issue 34, 27 April 2026.
A stacked memristor crossbar architecture is presented that enables direct in‐memory computation of Euclidean distance through intrinsic current subtraction at a shared middle electrode. By physically encoding weights and squared weights in vertically aligned layers, the system realizes energy‐efficient self‐organizing map learning, demonstrating ...
Jinwoo Park, Hyungjin Kim
wiley   +1 more source

Large‐Scale and Highly Reliable Hopfield Neural Networks Using Vertical NAND Flash Memory for the In‐Memory Associative Computing

open access: yesAdvanced Intelligent Systems, Volume 8, Issue 4, April 2026.
Large‐scale Hopfield neural networks (HNNs) for associative computing are implemented using vertical NAND (VNAND) flash memory. The proposed VNAND HNN with the asynchronous update scenario achieve robust image restoration performance despite fabrication variations, while significantly reducing chip area (≈117× smaller than resistive random‐access ...
Jin Ho Chang   +4 more
wiley   +1 more source

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm [PDF]

open access: yesJournal of Optimization in Industrial Engineering, 2014
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution.
Hossein Larki, Majid Yousefikhoshbakht
doaj  

Edge Elimination in TSP Instances

open access: yes, 2014
The Traveling Salesman Problem is one of the best studied NP-hard problems in combinatorial optimization. Powerful methods have been developed over the last 60 years to find optimum solutions to large TSP instances.
DL Applegate   +5 more
core   +1 more source

Bio‐Inspired Swarm Robotics Design for Mine Automation

open access: yesNatural Sciences, Volume 6, Issue 2, April 2026.
Ants demonstrate tandem running for cooperative haulage, and honeybees use memory‐based routes between hive and flowers. These behaviours inspire autonomous haulage robots in open‐pit mines to achieve efficient scan‐plan‐retrieve ore transport, replacing small haulage robots with large mining trucks.
Joven Tan   +2 more
wiley   +1 more source

A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.

open access: yesPLoS ONE, 2019
In the carrier-based coverage repair problem, a single mobile robot replaces damaged sensors by picking up spare ones in the region of interest or carrying them from a base station in wireless sensor and robot networks.
Kun Miao   +3 more
doaj   +1 more source

Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

open access: yesRevista Produção Online, 2014
In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and ...
Mário Mestria
doaj   +1 more source

Market Insurance and Risk Pooling in U.S. Crop Insurance

open access: yesAgricultural Economics, Volume 57, Issue 2, March 2026.
ABSTRACT A common assumption is that multiple‐peril crop insurance markets suffer from market failures, thus justifying government intervention in the form of premium subsidies, operating allowances, and reinsurance agreements. One prominent rationale for intervention involves geographic correlation in agricultural production which leads to systemic ...
Fan Fan   +3 more
wiley   +1 more source

A New Evolutionary Multiobjective Model for Traveling Salesman Problem

open access: yesIEEE Access, 2019
The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization, as many practical problems, such as scheduling problems and vehicle-routing cost allocation problems can be abstracted. The introduction
Xuejiao Chen   +5 more
doaj   +1 more source

Penentuan Rute Distribusi Teh Botol Menggunakan Metode Traveling Salesman Problem (Tsp) Untuk Minimasi Biaya Distribusi [PDF]

open access: yes, 2014
PT. Sinar Sosro merupakan salah satu Perusahaan yang bergerak dalam produk minuman yang terletak di Jl. Cangkir KM 21 Driyorejo Gresik, ada pun macam-macam produknya seperti Teh Botol, Fruit Tea, Cuntry Choice, Tebs dll.
& Sumiati, Fahmi Fuadi Al Akbar
core  

Home - About - Disclaimer - Privacy