Results 11 to 20 of about 51,613 (264)
Mathematics, 2022 The agile earth observation satellite scheduling problem (AEOSSP), as a time-dependent and arduous combinatorial optimization problem, has been intensively studied in the past decades.
Jiawei Chen +4 more
doaj +1 more source
A Quick Algorithm to Determine 2-Optimality Consensus for Collectives
IEEE Access, 2020 Nowadays, to solve a problem, people/systems typically use knowledge from different sources. A binary vector is a useful structure to represent knowledge states, and determining the consensus for a binary vector collective is helpful in many areas ...
Dai Tho Dang +2 more
doaj +1 more source
Sensors, 2022 For 5G and future Internet, in this paper, we propose a task allocation method for future Internet application to reduce the total latency in a mobile edge computing (MEC) platform with three types of servers: a dedicated MEC server, a shared MEC server,
Yukiko Katayama, Takuji Tachibana
doaj +1 more source
On the Improvement of the Heuristic Algorithm for Packing Circles into a Circle of Minimum Radius
Кібернетика та комп'ютерні технології, 2023 The article is devoted to investigation of a heuristic algorithm for solving the competitive problem "Circles Dense packing into a circle of minimum radius" and development of its improved version using Shor's r-algorithm with step dichotomy.
Bohdan Zadorozhnyi +2 more
doaj +1 more source
Examining Rebalancing Considers of the Mixed-Model Assembly Line Type-II for the Straight and U-shaped Layout Using the Taguchi Method [PDF]
Engineering and Technology Journal, 2021 Facing the increasingly competitive market environment, assembly lines are gained attention because of the assembly process expenditure consumes more than 20 % of the manufacturing cost, and also improve its products to meet demand.
Samah. A. Aufy +2 more
doaj +1 more source
Heuristic backtracking algorithms for SAT [PDF]
Proceedings. 4th International Workshop on Microprocessor Test and Verification - Common Challenges and Solutions, 2004 In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new challenging problem instances, many of which too hard for the current generation of SAT solvers. As a result,
Bhalla, A. +3 more
openaire +2 more sources
BCI Control of Heuristic Search Algorithms [PDF]
Frontiers in Neuroinformatics, 2017 The ability to develop Brain-Computer Interfaces (BCI) to Intelligent Systems would offer new perspectives in terms of human supervision of complex Artificial Intelligence (AI) systems, as well as supporting new types of applications. In this article, we introduce a basic mechanism for the control of heuristic search through fNIRS-based BCI.
Cavazza, Marc +2 more
openaire +4 more sources
IEEE Access, 2019 We consider the problem of planning an obstacle avoidance path for manipulators in cluttered environments especially with narrow passages. Compared to sampling-based planners, heuristic search-based planners are more suitable for such environments due to
Kai Mi +3 more
doaj +1 more source
IEEE Access, 2020 The Controller Placement Problem (CPP) is a key technical challenge in a large-scale Software Defined Network (SDN). Low-complexity heuristic algorithm is widely used for solving the CPP.
Yi Li +3 more
doaj +1 more source
Portfolio optimization with mean-variance approach using hunting search meta-heuristic algorithm [PDF]
تحقیقات مالی, 2014 This paper presents a new meta-heuristic solution to find the efficient frontier using the mean-variance approach. Portfolio optimization problem is a quadratic programming model and, changes to NP-hard if the number of assets and constraints has ...
Morteza Elahi +2 more
doaj +1 more source