期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,023篇文章
< 1 2 … 152 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
An Iterated Greedy Algorithm with Memory and Learning Mechanisms for the Distributed Permutation Flow Shop Scheduling Problem 认领 引用
1
作者 Binhui Wang Hongfeng Wang 《Computers, Materials & Continua》 SCIE EI 2025年第1期371-388,共18页
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o... The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling. 展开更多
关键词 Distributed permutation flow shop scheduling makespan iterated greedy algorithm memory mechanism cooperative reinforcement learning
暂未订购 下载PDF
Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets 认领 引用
2
作者 李妍峰 李军 赵达 《Journal of Southwest Jiaotong University(English Edition)》 2007年第4期344-352,共9页
To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to a... To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one. 展开更多
关键词 Vehicle routing problem Savings method Iterated dynasearch algorithm Dynamic programming Iterated local search Random kick Cyclic transfer
暂未订购 下载PDF
A Modi ed Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem 认领 引用 被引量：10
3
作者 Ghiath Al Aqel Xinyu Li Liang Gao 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2019年第2期157-167,共11页
The flexible job shop scheduling problem(FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are ca... The flexible job shop scheduling problem(FJSP) is considered as an important problem in the modern manufacturing system. It is known to be an NP-hard problem. Most of the algorithms used in solving FJSP problem are categorized as metaheuristic methods. Some of these methods normally consume more CPU time and some other methods are more complicated which make them di cult to code and not easy to reproduce. This paper proposes a modified iterated greedy(IG) algorithm to deal with FJSP problem in order to provide a simpler metaheuristic, which is easier to code and to reproduce than some other much more complex methods. This is done by separating the classical IG into two phases. Each phase is used to solve a sub-problem of the FJSP: sequencing and routing sub-problems. A set of dispatching rules are employed in the proposed algorithm for the sequencing and machine selection in the construction phase of the solution. To evaluate the performance of proposed algorithm, some experiments including some famous FJSP benchmarks have been conducted. By compared with other algorithms, the experimental results show that the presented algorithm is competitive and able to find global optimum for most instances. The simplicity of the proposed IG provides an e ective method that is also easy to apply and consumes less CPU time in solving the FJSP problem. 展开更多
关键词 Iterated greedy Flexible job shop scheduling problem Dispatching rules
暂未订购 下载PDF
An iterated local coordinate-exchange algorithm for constructing experimental designs for multi-dimensional constrained spaces 认领 引用 被引量：1
4
作者 YOU Yang JIN Guang +1 位作者 PAN Zhengqiang GUO Rui 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2021年第5期1212-1220,共9页
Iterated local search(ILS)is used to construct the optimal experimental designs for multi-dimensional constrained spaces,in which the inner loop is based on the stochastic coordinate-exchange(SCE)algorithm.Every time ... Iterated local search(ILS)is used to construct the optimal experimental designs for multi-dimensional constrained spaces,in which the inner loop is based on the stochastic coordinate-exchange(SCE)algorithm.Every time a local optimal solution is found by the SCE algorithm,the perturbation operator is applied to it,and then a new solution is explored in the areas where the exchange of coordinates may produce improvement,so as to retain the features and attributes of the current optimal solution and avoid the defects of random restart.We implement the iterated local coordinate-exchange algorithm for experimental designs in the multi-dimensional constrained spaces.In addition,sensitivity analysis was conducted to analyze the impacts of the parameters on the performance of the proposed algorithm.Also we compared the performance of the proposed algorithm to the SCE algorithm using the random restart strategy.The analysis shows that the proposed algorithm is better than the SCE algorithm in terms of efficiency and quality,especially in the experimental designs for high-dimensional constrained space. 展开更多
关键词 constrained space experimental design coordinate-exchange iterated local search(ILS)
暂未订购 下载PDF
Particle filter based on iterated importance density function and parallel resampling 认领 引用 被引量：1
5
作者 武勇 王俊 曹运合 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第9期3427-3439,共13页
The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, wher... The design, analysis and parallel implementation of particle filter(PF) were investigated. Firstly, to tackle the particle degeneracy problem in the PF, an iterated importance density function(IIDF) was proposed, where a new term associating with the current measurement information(CMI) was introduced into the expression of the sampled particles. Through the repeated use of the least squares estimate, the CMI can be integrated into the sampling stage in an iterative manner, conducing to the greatly improved sampling quality. By running the IIDF, an iterated PF(IPF) can be obtained. Subsequently, a parallel resampling(PR) was proposed for the purpose of parallel implementation of IPF, whose main idea was the same as systematic resampling(SR) but performed differently. The PR directly used the integral part of the product of the particle weight and particle number as the number of times that a particle was replicated, and it simultaneously eliminated the particles with the smallest weights, which are the two key differences from the SR. The detailed implementation procedures on the graphics processing unit of IPF based on the PR were presented at last. The performance of the IPF, PR and their parallel implementations are illustrated via one-dimensional numerical simulation and practical application of passive radar target tracking. 展开更多
关键词 particle filter iterated importance density function least squares estimate parallel resampling graphics processing unit
暂未订购 下载PDF
A LAW OF ITERATED LOGARITHM FOR THE MLE IN A RANDOM CENSORING MODEL WITH INCOMPLETE INFORMATION 认领 引用 被引量：2
6
作者 宋凤丽 刘禄勤 《Acta Mathematica Scientia》 SCIE 2008年第3期501-512,共12页
In this article, a law of iterated logarithm for the maximum likelihood estimator in a random censoring model with incomplete information under certain regular conditions is obtained.
关键词 Random censoring model maximum likelihood estimator law of iterated logarithm
暂未订购 下载PDF
ON COMPACTNESS FOR ITERATED COMMUTATORS 认领 引用 被引量：1
7
作者 刘永民 于燕燕 《Acta Mathematica Scientia》 SCIE CSCD 2011年第2期491-500,共10页
The authors study the iterated commutators on the weighted Bergman spaces A2（φ）, and prove that Cnh is compact on A2（φ） if and only if h ∈ B0.
关键词 Weighted Bergman space iterated commutator normal function littleBloch function compactness
暂未订购 下载PDF
PRECISE RATE IN THE LAW OF ITERATED LOGARITHM FOR ρ-MIXING SEQUENCE 认领 引用 被引量：8
8
作者 Huang Wei Zhang Lixin Jiang YeDept.of Math.,Zhejiang Univ.,Hangzhou 310028,China. 《Applied Mathematics(A Journal of Chinese Universities)》 2003年第4期482-488,共7页
Let {X,X n;n≥1} be a strictly stationary sequence of ρ-mixing random variables with mean zero and finite variance. Set S n=n k=1X k,M n=max k≤n｜S k｜,n≥1. Suppose lim n→∞ES2 n=∶σ2>0 and ∞n=1ρ 2/d(2n)... Let {X,X n;n≥1} be a strictly stationary sequence of ρ-mixing random variables with mean zero and finite variance. Set S n=n k=1X k,M n=max k≤n｜S k｜,n≥1. Suppose lim n→∞ES2 n=∶σ2>0 and ∞n=1ρ 2/d(2n)2(b+1),if b≥0. It is proved that,for any b>-1, limε0ε 2(b+1)∞n=1(loglogn)bnlognP{M n≥εσ2nloglogn}= 2(b+1)πГ(b+3/2)∞k=0(-1)k(2k+1) 2b+2,where Г(·) is a Gamma function. 展开更多
关键词 mixing random variable law of iterated logarithm tail probabilities
暂未订购 下载PDF
THE LAW OF ITERATED LOGARITHM FOR R/S STATISTICS 认领 引用 被引量：5
9
作者 林正炎 《Acta Mathematica Scientia》 SCIE 2005年第2期326-330,共5页
A law of iterated logarithm for R/S statistics with the help of the strong approximations of R/S statistics by functions of a Wiener process is shown.
关键词 R/S statistics law of iterated logarithm strong approximation
暂未订购 下载PDF
ITERATED FUNCTION SYSTEM AND GALTON-WATSON TREE 认领 引用 被引量：1
10
作者 余旌胡 谢南瑞 《Acta Mathematica Scientia》 SCIE 2007年第3期456-464,共9页
Given a system {S1,…, SN} of N contractive similarities satisfying some strong separation condition, it has an invariant Set K for the system. In this article, the authors construct some random measure μω supported... Given a system {S1,…, SN} of N contractive similarities satisfying some strong separation condition, it has an invariant Set K for the system. In this article, the authors construct some random measure μω supported on random subset Kω of K, μω having some ＂non-standard＂ multifractal structure, which contrasts the well-knoWn multifractal formalism for the invariant measure of system {S1,.., SN} may possess. The main tool is the multifractal structures of a Galton-Watson tree, which are obtained by Liu [9], Shieh-Taylor [14], and MSrters-Shieh [12]. 展开更多
关键词 Multifractal structure iterated function stysem Galton-Watson tree
暂未订购 下载PDF
A FAST CONVERGENT METHOD OF ITERATED REGULARIZATION 认领 引用
11
作者 黄小为 吴传生 吴笛 《Acta Mathematica Scientia》 SCIE 2009年第2期341-348,共8页
This article presents a fast convergent method of iterated regularization based on the idea of Landweber iterated regularization, and a method for a-posteriori choice by the Morozov discrepancy principle and the optim... This article presents a fast convergent method of iterated regularization based on the idea of Landweber iterated regularization, and a method for a-posteriori choice by the Morozov discrepancy principle and the optimum asymptotic convergence order of the regularized solution is obtained. Numerical test shows that the method of iterated regularization can quicken the convergence speed and reduce the calculation burden efficiently. 展开更多
关键词 Ill-posed problems iterated regularization Morozov discrepancy principle
暂未订购 下载PDF
A NONCLASSICAL LAW OF ITERATED LOGARITHM FOR NEGATIVELY ASSOCIATED RANDOM VARIABLES 认领 引用
12
作者 Jiang YeDept. of Math., Zhejiang University,Hangzhou 310028. 《Applied Mathematics(A Journal of Chinese Universities)》 2003年第2期200-208,共9页
A nonclassical law of iterated logarithm that holds for a stationary negatively associated sequence of random variables with finite variance is proved in this paper. The proof is based on a Rosenthal type maximal ineq... A nonclassical law of iterated logarithm that holds for a stationary negatively associated sequence of random variables with finite variance is proved in this paper. The proof is based on a Rosenthal type maximal inequality and the subsequence method.This result extends the work of Klesov,Rosalsky (2001) and Shao,Su (1999). 展开更多
关键词 negative dependence law of iterated logarithm nonclassical law of iterated logarithm.
暂未订购 下载PDF
Probabilistic data association algorithm based on ensemble Kalman filter with observation iterated update 认领 引用
13
作者 胡振涛 Fu Chunling Li Junwei 《High Technology Letters》 EI CAS 2015年第3期301-308,共8页
Aiming at improving the observation uncertainty caused by limited accuracy of sensors,and the uncertainty of observation source in clutters,through the dynamic combination of ensemble Kalman filter(EnKF) and probabili... Aiming at improving the observation uncertainty caused by limited accuracy of sensors,and the uncertainty of observation source in clutters,through the dynamic combination of ensemble Kalman filter(EnKF) and probabilistic data association(PDA),a novel probabilistic data association algorithm based on ensemble Kalman filter with observation iterated update is proposed.Firstly,combining with the advantages of data assimilation handling observation uncertainty in EnKF,an observation iterated update strategy is used to realize optimization of EnKF in structure.And the object is to further improve state estimation precision of nonlinear system.Secondly,the above algorithm is introduced to the framework of PDA,and the object is to increase reliability and stability of candidate echo acknowledgement.In addition,in order to decrease computation complexity in the combination of improved EnKF and PDA,the maximum observation iterated update mechanism is applied to the iteration of PDA.Finally,simulation results verify the feasibility and effectiveness of the proposed algorithm by a typical target tracking scene in clutters. 展开更多
关键词 nonlinear filter observation iterated update ensemble Kalman filter （EnKF） probabilistic data association （PDA）
暂未订购 下载PDF
SPECTRUM SHARING IN ITERATED PRISONER'S DILEMMA GAME BASED ON EVOLUTIONARY STRATEGIES FOR COGNITIVE RADIOS 认领 引用
14
作者 Tian Feng Yang Zhen 《Journal of Electronics(China)》 2009年第5期588-599,共12页
We study a spectrum sharing problem where multiple systems coexist and interfere with each other.First,an analysis is proposed for distributed spectrum sharing based on Prisoners'Dilemma(PD)in Cognitive Radios(CRs... We study a spectrum sharing problem where multiple systems coexist and interfere with each other.First,an analysis is proposed for distributed spectrum sharing based on Prisoners'Dilemma(PD)in Cognitive Radios(CRs).In one-shot game,selfish and rational CRs greedily full spread their own spectrum space in order to maximize their own rates,which leads to Nash Equilibrium(N.E.).But with long term interaction,i.e.,Iterated Prisoner's Dilemma(IPD),CRs can come to cooperate and acquire the social optimal point by using different evolutionary strategies such as Tit For Tat(TFT),Generous TFT(GTFT),etc.Also we compare the performances of the different evolutionary strategies in noise-free and noisy environments for two-player games.Finally,N-player IPD(N-IPD)is simulated to verify our conclusions that TFT is a good strategy for spectrum sharing in CRs. 展开更多
关键词 Cognitive Radio(CR) Iterated Prisoner's Dilemma(IPD) Spectrum sharing Evolutionary strategies Gaussian interference channel
暂未订购 下载PDF
LIMIT OF ITERATES FOR BERNSTEIN POLYNOMIALS DEFINED ON A TRIANGLE 认领 引用
15
作者 陈发来 冯玉瑜 《Applied Mathematics(A Journal of Chinese Universities)》 1993年第1期45-53,共9页
Let f ∈ C[0,1] , and Bn(f,x) be the n-th Bernstein polynomial associated with function f. In 1967, the limit of iterates for Bn(f,x) was given by Kelisky and Rivlin. After this, Many mathematicians studied and genera... Let f ∈ C[0,1] , and Bn(f,x) be the n-th Bernstein polynomial associated with function f. In 1967, the limit of iterates for Bn(f,x) was given by Kelisky and Rivlin. After this, Many mathematicians studied and generalized this result. But anyway, all these discussions are only for univariate case. In this paper, the main contribution is that the limit of iterates for Bernstein polynomial defined on a triangle is given completely. 展开更多
关键词 Bernstein Polynomial Asymptotical Formula Limit of Iterates.
暂未订购 下载PDF
Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags 认领 引用 被引量：4
16
作者 Ning ZHAO Song YE +1 位作者 Kaidian LI Siyu CHEN 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2017年第3期652-662,共11页
Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem（PFSP with time lags） is concentrated but non-permutation problem（non-PFSP with time lags... Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem（PFSP with time lags） is concentrated but non-permutation problem（non-PFSP with time lags） seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algo- rithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation（IGTLP） and iterated greedy algorithm for non-permutation （IGTLNP）. The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% com- putational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation. 展开更多
关键词 Permutation Non-permutation Flow shopTime lags . Makespan Iterated greedy algorithm
暂未订购 下载PDF
Iterated Conditional Modes to Solve Simultaneous Localization and Mapping in Markov Random Fields Context 认领 引用 被引量：5
17
作者 J.Gimenez A.Amicarelli +2 位作者 J.M.Toibero F.di Sciascio R.Carelli 《International Journal of Automation and computing》 CSCD 2018年第3期310-324,共15页
This paper models the complex simultaneous localization and mapping（SLAM） problem through a very flexible Markov random field and then solves it by using the iterated conditional modes algorithm. Markovian models al... This paper models the complex simultaneous localization and mapping（SLAM） problem through a very flexible Markov random field and then solves it by using the iterated conditional modes algorithm. Markovian models allow to incorporate： any motion model; any observation model regardless of the type of sensor being chosen; prior information of the map through a map model; maps of diverse natures; sensor fusion weighted according to the accuracy. On the other hand, the iterated conditional modes algorithm is a probabilistic optimizer widely used for image processing which has not yet been used to solve the SLAM problem. This iterative solver has theoretical convergence regardless of the Markov random field chosen to model. Its initialization can be performed on-line and improved by parallel iterations whenever deemed appropriate. It can be used as a post-processing methodology if it is initialized with estimates obtained from another SLAM solver. The applied methodology can be easily implemented in other versions of the SLAM problem, such as the multi-robot version or the SLAM with dynamic environment. Simulations and real experiments show the flexibility and the excellent results of this proposal. 展开更多
关键词 Simultaneous localization and mapping Markov random fields iterated conditional modes modelling on-line solver.
暂未订购 下载PDF
Improved Adaptive Iterated Extended Kalman Filter for GNSS/INS/UWB-Integrated Fixed-Point Positioning 认领 引用 被引量：4
18
作者 Qingdong Wu Chenxi Li +1 位作者 Tao Shen Yuan Xu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第3期1761-1772,共12页
To provide stable and accurate position information of control points in a complex coastal environment,an adaptive iterated extended Kalman filter(AIEKF)for fixed-point positioning integrating global navigation satell... To provide stable and accurate position information of control points in a complex coastal environment,an adaptive iterated extended Kalman filter(AIEKF)for fixed-point positioning integrating global navigation satellite system,inertial navigation system,and ultra wide band(UWB)is proposed.In thismethod,the switched global navigation satellite system(GNSS)and UWB measurement are used as the measurement of the proposed filter.For the data fusion filter,the expectation-maximization(EM)based IEKF is used as the forward filter,then,the Rauch-Tung-Striebel smoother for IEKF filter’s result smoothing.Tests illustrate that the proposed AIEKF is able to provide an accurate estimation. 展开更多
关键词 Rauch-tung-striebel ultra wide band global navigation satellite system adaptive iterated extended kalman filter
暂未订购 下载PDF
Continuous Probabilistic SLAM Solved via Iterated Conditional Modes 认领 引用 被引量：2
19
作者 J.Gimenez A.Amicarelli +2 位作者 J.M.Toibero F.di Sciascio R.Carelli 《International Journal of Automation and computing》 CSCD 2019年第6期838-850,共13页
This article proposes a simultaneous localization and mapping(SLAM) version with continuous probabilistic mapping(CPSLAM), i.e., an algorithm of simultaneous localization and mapping that avoids the use of grids, and ... This article proposes a simultaneous localization and mapping(SLAM) version with continuous probabilistic mapping(CPSLAM), i.e., an algorithm of simultaneous localization and mapping that avoids the use of grids, and thus, does not require a discretized environment. A Markov random field(MRF) is considered to model this SLAM version with high spatial resolution maps. The mapping methodology is based on a point cloud generated by successive observations of the environment, which is kept bounded and representative by including a novel recursive subsampling method. The CP-SLAM problem is solved via iterated conditional modes(ICM), which is a classic algorithm with theoretical convergence over any MRF. The probabilistic maps are the most appropriate to represent dynamic environments, and can be easily implemented in other versions of the SLAM problem, such as the multi-robot version. Simulations and real experiments show the flexibility and excellent performance of this proposal. 展开更多
关键词 Probabilistic simultaneous localization and mapping(SLAM) dynamic obstacles Markov random fields(MRF) iterated conditional modes(ICM) kernel estimator
暂未订购 下载PDF
Compactness of Iterated Commutators on Weighted Bergman Spaces 认领 引用
20
作者 Liu Yongmin 《Northeastern Mathematical Journal》 1999年第4期479-485,共7页
Letφbe a normal function on[0,1),and let A2(φ)denote the closed subspace of L2(φ)consisting of all analytic functions in the unit disk D.For any normal functionφ,a necessary and sufficient condition for iter... Letφbe a normal function on[0,1),and let A2(φ)denote the closed subspace of L2(φ)consisting of all analytic functions in the unit disk D.For any normal functionφ,a necessary and sufficient condition for iterated commutators on the weighted Bergman space A2(φ)to be compact is given in this paper. 展开更多
关键词 Normal Function Compactness Weighted Bergman Space Iterated Commputator
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 152 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈