Computing

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Particle swarm optimization based on temporal-difference learning for solving multi-objective optimization problems
Computing - Tập 105 - Trang 1795-1820 - 2023
Desong Zhang, Guangyu Zhu
Multi-objective evolutionary algorithms have become the most important method to deal with multi-objective optimization problems (MOP). To improve the performance of particle swarm optimization (PSO) in addressing MOPs, a multi-objective PSO based on temporal-difference learning (TDLMOPSO) is proposed in this paper. The iteration process of TDLMOPSO is transformed into a Markov decision process, p...... hiện toàn bộ
On the R-order of coupled sequences II
Computing - Tập 29 Số 1 - Trang 73-81 - 1982
W. Burmeister, Jochen Schmidt
MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks
Computing - Tập 104 - Trang 359-382 - 2021
Sanjay Kumar, Dipti Lohia, Darsh Pratap, Ashutosh Krishna, B. S. Panda
The online social network has become an integral part of our day to life and serves as an excellent platform for sharing ideas, opinions, and products. Influence maximization (IM) is a widely studied topic in the area of social network analysis. The objective of IM is to find influential nodes that can disseminate information to a larger extent in the network. Many local and global centrality meas...... hiện toàn bộ
Errata: Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
Computing - Tập 59 - Trang 94-94 - 1997
R. Horst, N. V. Thoai
A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net
Computing - - 2002
M. H. Karaata, P. Chaudhuri
corresponding to an undirected biconnected graph on a distributed or network model of computation. The algorithm is resilient to transient faults and does not require initialization. In addition, it is capable of handling topology changes in a transient manner. The paper includes a correctness proof of the algorithm. Finally, it concludes with some final remarks.
Scheduling a Single Server in a Two-machine Flow Shop
Computing - Tập 70 - Trang 167-180 - 2003
T. C. E. Cheng, M. Y. Kovalyov
We study the problem of scheduling a single server that processes n jobs in a two-machine flow shop environment. A machine dependent setup time is needed whenever the server switches from one machine to the other. The problem with a given job sequence is shown to be reducible to a single machine batching problem. This result enables several cases of the server scheduling problem to be solved in O(...... hiện toàn bộ
Least significant bit evaluation of arithmetic expressions in single-precision
Computing - Tập 30 - Trang 189-199 - 1983
S. M. Rump, H. Böhm
Single-precision floatingpoint computations may yield an arbitrary false result due to cancellation and rounding errors. This is true even for very simple, structured arithmetic expressions such as Horner's scheme for polynomial evaluation. A simple procedure will be presented for fast calculation of the value of an arithmetic expression to least significant bit accuracy in single precision comput...... hiện toàn bộ
Bisection forAx=λBx with matrices of variable band width
Computing - Tập 28 - Trang 171-180 - 1982
P. Waldvogel
Some extensions of the bisection method and of the inverse vector iteration for the general eigenvalue problemAx=λBx with symmetric matrices are given. A version with restricted pivoting is applied to sparse matricesA andB in which case the decomposition ofA-μB can be performed within an extended envelope with respect to the envelopeA andB. The effect of these refinements is illustrated by an exam...... hiện toàn bộ
Bernoulli functions and periodic B-splines
Computing - Tập 38 - Trang 23-31 - 1987
F. -J. Delvos
Bernoulli polynomials and the related Bernoulli functions are of basic importance in theoretical numerical analysis. It was shown by Golomb and others that the periodic Bernoulli functions serve to construct periodic polynomial splines on uniform meshes. In an unknown paper Wegener investigated remainder formulas for polynomial Lagrange interpolation via Bernoulli functions. We will use Wegener's ...... hiện toàn bộ
Effective clustering protocol based on network division for heterogeneous wireless sensor networks
Computing - Tập 102 - Trang 413-425 - 2019
Wided Abidi, Tahar Ezzedine
The major challenge in wireless sensor networks is to reduce energy consumption and increase the lifetime of the network. In this paper, we propose an effective protocol to address this issue. In fact, our proposed protocol is based on first inserting heterogeneous nodes in the network, then dividing the network to regions. And finally, the selection of the Cluster Head (CH) is carried out using t...... hiện toàn bộ
Tổng số: 2,424   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10