Results 41 to 50 of about 28,852 (210)
Minimum energy configurations of the 2-dimensional HP-model of proteins by self-organizing networks [PDF]
, 2002 We use self-organizing maps (SOM) as an efficient tool to find the minimum energy configurations of the 2-dimensional HP-models of proteins. The usage of the SOM for the protein folding problem is similar to that for the Traveling Salesman Problem.
Erman, Burak +2 more
core +1 more source
Indoor Traveling Salesman Problem (ITSP) Path Planning
ISPRS International Journal of Geo-Information, 2021 With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance ...
Jinjin Yan +3 more
doaj +1 more source
Advanced Physics Research, EarlyView.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
Robot Monitoring for the Detection and Confirmation of Stochastic Events
, 2014 In this paper we consider a robot patrolling problem in which events arrive randomly over time at the vertices of a graph. When an event arrives it remains active for a random amount of time.
Asghar, Ahmad Bilal, Smith, Stephen L.
core +1 more source
An Optimal Control Theory for the Traveling Salesman Problem and Its Variants [PDF]
, 2020 We show that the traveling salesman problem (TSP) and its many variants may be modeled as functional optimization problems over a graph. In this formulation, all vertices and arcs of the graph are functionals; i.e., a mapping from a space of measurable ...
Karpenko, M., Proulx, R. J., Ross, I. M.
core +1 more source
Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch
Naval Research Logistics (NRL), EarlyView.ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley +1 more source
Path Planning for Cooperative Routing of Air-Ground Vehicles
, 2016 We consider a cooperative vehicle routing problem for surveillance and reconnaissance missions with communication constraints between the vehicles.
Casbeer, David +2 more
core +1 more source
The Application of Ant Colony Algorithm in Solve the Traveling Salesman Problem with Fuzzy Movement Time among Cities [PDF]
Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2010 Traveling salesman problem (TSP) is one of the most well-known combinational optimization problems which recently has been a suitable base to validate different heuristic and Meta heuristic algorithms.
Jamshid Salehi Sadaghiani
doaj
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT A formation inversion algorithm with real‐time performance and accuracy is crucial for natural gamma logging while drilling (LWD). However, traditional inversion algorithms are often limited by high computational resource consumption and insufficient accuracy.
Juntao Liu +4 more
wiley +1 more source
k-RNN: Extending NN-heuristics for the TSP
, 2018 In this paper we present an extension of existing Nearest-Neighbor heuristics to an algorithm called k-Repetitive-Nearest-Neighbor. The idea is to start with a tour of k nodes and then perform a Nearest-Neighbor search from there on. After doing this for
Chauhan, Alok +3 more
core +1 more source