Results 51 to 60 of about 179,741 (181)
Energy-Efficient Chain Formation Algorithm for Data Gathering in Wireless Sensor Networks
International Journal of Distributed Sensor Networks, 2012 In wireless sensor networks, since sensor nodes are distributed in inaccessible regions for data gathering, they need to be operated during an assigned time without battery recharging and relocation.
Se-Jung Lim, Myong-Soon Park
doaj +1 more source
Optimization of PWSN transmission performance on coal mining face
Gong-kuang zidonghua, 2020 In view of problems of long end-to-end time and high packet loss rate of positioning wireless sensor network (PWSN) on coal mining face, a guaranteed greedy scheduling (GGS) algorithm was proposed to optimize network transmission performance.
FANG Zuhao +3 more
doaj +1 more source
Sampling and Reconstruction of Graph Signals via Weak Submodularity and Semidefinite Relaxation
, 2017 We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE).
Hashemi, Abolfazl +3 more
core +1 more source
The Feature Compression Algorithms for Identifying Cytokines Based on CNT Features
IEEE Access, 2020 As the signaling proteins, cytokines regulate a wide range of biological functions. It is important to distinguish the cytokines from other kinds of proteins.
Guilin Li, Xing Gao
doaj +1 more source
An Improved Q-Learning Algorithm and Its Application in Path Planning
Taiyuan Ligong Daxue xuebao, 2021 Traditional Q-Learning algorithm has the problems of too many random searches and slow convergence speed. Therefore, in this paper an improved ε-Q-Learning algorithm based on traditional Q-Learning algorithm was propased and applied to path planning. The
Guojun MAO, Shimin GU
doaj +1 more source
Analysis of Performance of Dynamic Multicast Routing Algorithms
, 1998 In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of
Ballardie +16 more
core +2 more sources
, 2018 A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path.
C Batini +19 more
core +1 more source
A greedy algorithm for interval greedoids
Open Mathematics, 2018 We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
Mao Hua
doaj +1 more source
No-Wait Job Shop Scheduling Using a Population-Based Iterated Greedy Algorithm
Algorithms, 2021 When no-wait constraint holds in job shops, a job has to be processed with no waiting time from the first to the last operation, and the start time of a job is greatly restricted. Using key elements of the iterated greedy algorithm, this paper proposes a
Mingming Xu +2 more
doaj +1 more source
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
Algorithms, 2020 We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid ...
Jonathan Li +2 more
doaj +1 more source