Results 111 to 120 of about 21,948 (228)

An optimization algorithm for maximum quasi-clique problem based on information feedback model [PDF]

PeerJ Computer Science
The maximum clique problem in graph theory is a well-known challenge that involves identifying the complete subgraph with the highest number of nodes in a given graph, which is a problem that is hard for nondeterministic polynomial time (NP-hard problem).
Shuhong Liu, Jincheng Zhou, Dan Wang, Zaijun Zhang, Mingjie Lei   +4 more
doaj   +2 more sources

Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem

Complexity, 2017
The train-set circulation plan problem (TCPP) belongs to the rolling stock scheduling (RSS) problem and is similar to the aircraft routing problem (ARP) in airline operations and the vehicle routing problem (VRP) in the logistics field.
Yu Zhou, Leishan Zhou, Yun Wang, Zhuo Yang, Jiawei Wu   +4 more
doaj   +1 more source

Efficient and secure task scheduling in cloud communication using hybrid convolutional neural network and enhanced encryption techniques

AKCE International Journal of Graphs and Combinatorics
Cloud communication is a combination of distributed computing and parallel computing. Task scheduling is a major challenge in cloud communications due to the NP-completeness of cloud systems.
Swaminathan G., Sukumar P.
doaj   +1 more source

Exploring UAV autonomous navigation algorithm based on soft actor-critic

Xibei Gongye Daxue Xuebao
The existing deep reinforced learning algorithms cannot see local environments and have insufficient perceptual information on UAV autonomous navigation tasks. The paper investigates the UAV's autonomous navigation tasks in its unknown environments based
KOU Kai, YANG Gang, ZHANG Wenqi, LIU Xincheng, YAO Yuan, ZHOU Xingshe   +5 more
doaj   +1 more source

Parallel decomposition of control algorithms for computational processes based on the use of nondeterministic automaton logic

, 2021
Dmitry V. Pashchenko, А. И. Мартышкин, Dmitry A. Trokoz, Tatyana Yu. Pashchenko, Mikhail Yu. Babich, Mikhail M. Butaev   +5 more
openalex   +1 more source

Safe Decision Controller for Autonomous DrivingBased on Deep Reinforcement Learning inNondeterministic Environment. [PDF]

Sensors (Basel), 2023
Chen H, Zhang Y, Bhatti UA, Huang M.
europepmc   +1 more source

Probabilistic Nearest Neighbors Classification. [PDF]

Entropy (Basel), 2023
Fava B, F PCM, Lopes HF.
europepmc   +1 more source

Bisimilarity control of partially observed nondeterministic discrete event systems and a test algorithm

, 2011
Fuchun Liu, Hai Lin, Zbigniew Dziong
openalex   +2 more sources

On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes. [PDF]

Entropy (Basel), 2023
Ostonov A, Moshkov M.
europepmc   +1 more source

An adaptive genetic algorithm with double populations for solving traveling salesman problems

Journal of Intelligent Systems
Traveling salesman problem (TSP) is a typical combinatorial optimization problem which is regarded as an NP (nondeterministic polynomial)-hard problem.
Taishan Yan, Xin Chen, Baoshuang Yan
doaj   +1 more source