An Optimal Schedule for Urban Road Network Repair Based on the Greedy Algorithm. [PDF]
PLoS ONE, 2016 The schedule of urban road network recovery caused by rainstorms, snow, and other bad weather conditions, traffic incidents, and other daily events is essential. However, limited studies have been conducted to investigate this problem.
Guangquan Lu +3 more
doaj +2 more sources
Improving Greedy Spanner Construction Algorithm [PDF]
Computer and Knowledge Engineering, 2023 In recent years, several algorithms with different time complexities have been proposed for the construction of greedy spanners. However, a not so apparently suitable algorithm with running time complexity , namely the FG algorithm, is proved to be ...
hosein salami, Mostafa Nouri Baygi
doaj +1 more source
Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
Mathematics, 2023 We first study the error performances of the Vector Weak Rescaled Pure Greedy Algorithm for simultaneous approximation with respect to a dictionary D in a Hilbert space.
Xu Xu +3 more
doaj +1 more source
A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2023 This study describes a novel greedy algorithm for optimizing the well-known Curriculum-Based Course Timetabling (CB-CTT) problem. Greedy algorithms are a good alternative to brute-force and evolutionary algorithms, which take a long time to execute in ...
Batuhan Mustafa Coşar +2 more
doaj +1 more source
A quick Heuristic and a general search algorithm for traveling salesman problem [PDF]
E3S Web of Conferences, 2022 This paper puts forward a constructive heuristic algorithm called the method of inserting the minimum neighbor edge from outside to the center (IMNEFOTC) that can be applied to solve large-scale and ultra-large-scale travelling salesman problems. Through
Wang Chao, Wang Deguang, Jin Chun
doaj +1 more source
Exact and greedy algorithms of allocating experts to maximum set of programmer teams
Системный анализ и прикладная информатика, 2022 The allocation of experts to programmer teams, which meet constraints on professional competences related to programming technologies, languages and tools an IT project specifies is a hard combinatorial problem.
A. A. Prihozhy
doaj +1 more source
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
Algorithms, 2023 In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the ...
Tommaso Adamo +3 more
doaj +1 more source
Reaching for upper bound ROUGE score of extractive summarization methods [PDF]
PeerJ Computer Science, 2022 The extractive text summarization (ETS) method for finding the salient information from a text automatically uses the exact sentences from the source text.
Iskander Akhmetov +2 more
doaj +2 more sources
Improved Epsilon-greedy Algorithm for Cold-start Problem of New Users [PDF]
Jisuanji gongcheng, 2018 When solving the cold-start problem of new users,fixed and invariant Epsilon parameters will slow the convergence of traditional Epsilon-greedy algorithm.Therefore,an improved Epsilon-greedy algorithm is proposed.Immune feedback model is used to ...
WANG Suqin,ZHANG Yang,JIANG Hao,ZHU Dengming
doaj +1 more source
Optimal Placement Method of City Surveillance Camera Network Based on Road Coverage [PDF]
Jisuanji gongcheng, 2016 City surveillance camera network provides a powerful support for finding criminal suspects and tracing their routes.In order to benefit from the surveillance camera network,and optimize the placement of surveillance camera network to improve efficiency ...
WEI Hao,CHEN Huafeng,CHEN Jun
doaj +1 more source