Results 11 to 20 of about 179,741 (181)
To meet the multi-cooperation production demand of enterprises, the distributed permutation flow shop scheduling problem (DPFSP) has become the frontier research in the field of manufacturing systems. In this paper, we investigate the DPFSP by minimizing
Xue Han +7 more
doaj +3 more sources
Improved Epsilon-greedy Algorithm for Cold-start Problem of New Users [PDF]
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
Research on task assignment to minimize travel cost for spatio-temporal crowdsourcing
Online task assignment is one of the core research issues of spatio-temporal crowdsourcing technology. The current researches on minimizing travel cost all focus on the scenario of two objectives (task requesters and workers).
Qingxian Pan +3 more
doaj +1 more source
Reaching for upper bound ROUGE score of extractive summarization methods [PDF]
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
Hyperparameter Optimization Using Successive Halving with Greedy Cross Validation
Training and evaluating the performance of many competing Artificial Intelligence (AI)/Machine Learning (ML) models can be very time-consuming and expensive.
Daniel S. Soper
doaj +1 more source
WSN Self-Adaptive Relay Selection for Distribution Grid Monitoring
To research the relay selection of wireless sensor network ( WSN) to improve the monitoring level of distribution network, a self-adaptive ε-greedy algorithm-based WSN relay selection optimization method is proposed according to the existing ε- greedy ...
YANG Huifeng +5 more
doaj +1 more source
A NOVEL GREEDY GENETIC ALGORITHM TO SOLVE COMBINATORIAL OPTIMIZATION PROBLEM [PDF]
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
Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice?
Badanidiyuru, Ashwinkumar +4 more
core +1 more source
Collapsing Superstring Conjecture [PDF]
In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713).
Golovnev, Alexander +4 more
core +2 more sources
Self-Dictionary Sparse Regression for Hyperspectral Unmixing: Greedy Pursuit and Pure Pixel Search are Related [PDF]
This paper considers a recently emerged hyperspectral unmixing formulation based on sparse regression of a self-dictionary multiple measurement vector (SD-MMV) model, wherein the measured hyperspectral pixels are used as the dictionary.
Bioucas-Dias, José M. +3 more
core +2 more sources

