Výsledky vyhledávání - "combinatorial optimization problem"

A Probabilistic Compute Fabric Based on Coupled Ring Oscillators for Solving Combinatorial Optimization Problems Autor Ahmed, Ibrahim, Chiu, Po-Wei, Moy, William, Kim, Chris H.

“…Nondeterministic polynomial time hard (NP-hard) combinatorial optimization problems (COPs) are intractable to solve using a traditional computer as the time to…”
Získat plný text

A 20k-Spin Ising Chip to Solve Combinatorial Optimization Problems With CMOS Annealing Autor Yamaoka, Masanao, Yoshimura, Chihiro, Hayashi, Masato, Okuyama, Takuya, Aoki, Hidetaka, Mizuno, Hiroyuki

“…In the near future, the ability to solve combinatorial optimization problems will be a key technique to enable the IoT era. A new computing architecture called…”
Získat plný text

Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem Autor Anniza Hamdan, Sze San Nah, Goh Say Leng, Chiew Kang Leng, Tiong Wei King

“…The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm…”
Získat plný text

GAPBAS: Genetic algorithm-based privacy budget allocation strategy in differential privacy K-means clustering algorithm Autor Li, Yong, Song, Xiao, Tu, Yuchun, Liu, Ming

“…The differential privacy k-means (DP k-means) clustering algorithm emerged to address the privacy protection challenges in the field of data mining. However,…”
Získat plný text

An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems Autor Li, Xiaotong, Fang, Wei, Zhu, Shuwei

“…The 0-1 knapsack problem is a typical NP-hard combinatorial optimization problem that is difficult to solve efficiently based on traditional optimization…”
Získat plný text

A discrete bat algorithm based on Lévy flights for Euclidean traveling salesman problem Autor Saji, Yassine, Barkatou, Mohammed

“…•A new discrete bat algorithm based on Lévy flights is proposed.•2-opt, 2.5-opt and 3-opt define the movement of bats in the search space.•A modified uniform…”
Získat plný text

Two sided disassembly line balancing problem with rest time of works: A constraint programming model and an improved NSGA II algorithm Autor Xu, ZhenYu, Han, Yong

Získat plný text

CIM-Spin: A Scalable CMOS Annealing Processor With Digital In-Memory Spin Operators and Register Spins for Combinatorial Optimization Problems Autor Su, Yuqi, Kim, Hyunjoon, Kim, Bongjin

“…Recently, annealing processors based on the Ising model have received rising attention as efficient alternative hardware for solving combinatorial optimization…”
Získat plný text

Coherent Potts machine based on an optical loop with a multilevel phase-sensitive amplifier Autor Inoue, Kyo, Yoshida, Kazuhiro, Kitahara, Shogo

“…The Potts model is an extended version of the Ising model that has been intensively studied for applications in physical computers solving combinatorial…”
Získat plný text

Resistance distances in directed graphs: Definitions, properties, and applications Autor Zhu, Mingzhe, Zhu, Liwang, Li, Huan, Li, Wei, Zhang, Zhongzhi

“…Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact…”
Získat plný text

Container stacking optimization based on Deep Reinforcement Learning Autor Jin, Xin, Duan, Zhentang, Song, Wen, Li, Qiqiang

“…Cargo storage is one of the key aspects of the maritime transportation. As the prior site planning, container stacking has a critical influence on the…”
Získat plný text

Approximation Algorithms for Charging Reward Maximization in Rechargeable Sensor Networks via a Mobile Charger Autor Weifa Liang, Zichuan Xu, Wenzheng Xu, Jiugen Shi, Guoqiang Mao, Das, Sajal K.

“…Wireless energy transfer has emerged as a promising technology for wireless sensor networks to power sensors with controllable yet perpetual energy. In this…”
Získat plný text

SLAM: Extending the Reach of Ising Machine Advantage Autor Burns, Matthew X., Azad, Zahra, Liu, Yongchao, Geng, Tony, Wu, Hui, Huang, Michael C.

“…Dynamics-based Ising machines (IMs) are a promising substrate for high-speed combinatorial optimization and sampling. For problems that fit within their fixed…”
Získat plný text

FlexSpin: A CMOS Ising Machine With 256 Flexible Spin Processing Elements With 8-b Coefficients for Solving Combinatorial Optimization Problems Autor Su, Yuqi, Kim, Tony Tae-Hyoung, Kim, Bongjin

“…Combinatorial optimization problems (COPs) are essential in various applications, including data clustering, supply chain management, and communication…”
Získat plný text

Review of Reinforcement Learning for Combinatorial Optimization Problem Autor WANG Yang, CHEN Zhibin, WU Zhaorui, GAO Yuan

“…The solution methods for combinatorial optimization problem (COP) have permeated to the fields of artificial intelligence, operations research, etc. With the…”
Získat plný text

Multi-task oriented team formation in online collaborative learning Autor Chen, Yingzhi, Zhang, Lichen, Ding, Yu, Guo, Longjiang, Bian, Kexin

“…Rational and personalized team formation can greatly enhance the efficiency of online collaborative learning. However, in the process of forming learning teams…”
Získat plný text

Boltzmann Sampling by Degenerate Optical Parametric Oscillator Network for Structure-Based Virtual Screening Autor Sakaguchi, Hiromasa, Ogata, Koji, Isomura, Tetsu, Utsunomiya, Shoko, Yamamoto, Yoshihisa, Aihara, Kazuyuki

“…A structure-based lead optimization procedure is an essential step to finding appropriate ligand molecules binding to a target protein structure in order to…”
Získat plný text

Multimodel Framework for Indoor Localization Under Mobile Edge Computing Environment Autor Li, Wenjun, Chen, Zhenyu, Gao, Xingyu, Liu, Wei, Wang, Jin

“…Location estimation technology under the wireless environment has become a vital technology in the field of mobile edge computing. Especially, under the mobile…”
Získat plný text

Efficient routing optimization with discrete penguins search algorithm for MTSP Autor Mzili, Ilyass, Mzili, Toufik, Riffi, Mohammed Essaid

“…The Travelling Salesman Problem (TSP) is a well-known combinatorial optimization problem that belongs to a class of problems known as NP-hard, which is an…”
Získat plný text

Multi-level probabilistic computing: application to the multiway number partitioning problems Autor Han, Ki Hyuk, Park, Gyuyoung, Ahn, Jeong Ung, Kim, YongJin, Yun, Deok Hyun, Jang, Seung-Hun, Nah, Young-Jun, Kang, Min-Gu, Koo, Hyun Cheol, Lee, OukJae

“…Probabilistic computing, a class of physics-based computing, bridges the gap between quantum computing and the classical von Neumann architecture. This…”
Získat plný text