Results 31 to 40 of about 129,100 (297)
A NOVEL GREEDY GENETIC ALGORITHM TO SOLVE COMBINATORIAL OPTIMIZATION PROBLEM [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 In this paper, a modified genetic algorithm based on greedy sequential algorithm is presented to solve combinatorial optimization problem. The algorithm proposed here is a hybrid of heuristic and computational intelligence algorithm where greedy ...
M. A. Basmassi +2 more
doaj +1 more source
A new efficient RLF-like algorithm for the vertex coloring problem [PDF]
Yugoslav Journal of Operations Research, 2016 The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color classes on the basis of greedy choices.
Adegbindin Mourchid +2 more
doaj +1 more source
Greedy strategy for some normal m x n closing octagons games and winning strategy for normal 1 x n and 2 x n closing octagons games [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 m x n Closing Octagons (CO) game is a combinatorial game for two players. The game starts with an m x n array of octagons such that every two adjacent octagons has one common side and 0 points. Players alternately turn by the following rules.
Ratinan Boonklurb +1 more
doaj +1 more source
On-line coloring of $I_s$-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 An on-line vertex coloring algorithm receives vertices of a graph in some externally determined order. Each new vertex is presented together with a set of the edges connecting it to the previously presented vertices.
Iwona Cieslik, Marcin Kozik, Piotr Micek
doaj +1 more source
DESIGN OF WEB-BASED UYU STORE ATTENDANCE INFORMATION SYSTEM USING COLORING METHOD
Jurnal Riset Informatika, 2021 Attendance in the world of work is sometimes still done manually. At the Uyu shop, there are still problems that occur in recording and making attendance reports manually, such as mistakes in biodata, forgetting to record the date.
Christy Octavius, Deny Hidayatullah
doaj +1 more source
A Role Division Method Constrained by Static Separation of Duty [PDF]
Jisuanji gongcheng, 2018 The existing top-down role of the project ignores the requirements of the enterprise for sensitive tasks,resulting in a low set of security.In order to improve the security of role division,a user role assignment method constrained by static separation ...
WANG Jingyu,DONG Jingnan,TAN Yuesheng
doaj +1 more source
International Journal of Cognitive Computing in Engineering, 2023 The Graph Coloring Problem is an NP-hard combinatorial optimization problem, and it is being used in different real-world environments. The chromatic integer is determined using different probabilistic methods.
S. Balakrishnan +4 more
doaj +1 more source
Science Journal of University of Zakho, 2023 The seriousness of the spectrum scarcity has increased dramatically due to the rapid increase of wireless services. The key enabling technology that can be viewed as a novel approach for utilizing the spectrum more efficiently is known as Cognitive ...
Kurdistan Mohsin Salih +2 more
doaj +1 more source
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chartrand, Gary +2 more
openaire +2 more sources
First-Fit coloring of Cartesian product graphs and its defining sets [PDF]
, 2016 Let the vertices of a Cartesian product graph $G\Box H$ be ordered by an ordering $\sigma$. By the First-Fit coloring of $(G\Box H, \sigma)$ we mean the vertex coloring procedure which scans the vertices according to the ordering $\sigma$ and for each ...
Zaker, Manouchehr
core +3 more sources