检索结果-内蒙古大学图书馆

IMPROVING HIT-AND-RUN FOR GLOBAL OPTIMIZATION

JOURNAL OF GLOBAL OPTIMIZATION 1993年第2期3卷 171-192页

作者： ZABINSKY, ZB SMITH, RL MCDONALD, JF ROMEIJN, HE KAUFMAN, DE UNIV WASHINGTON IND ENGN PROGRAM FU-20 SEATTLE WA 98195 USA UNIV MICHIGAN DEPT IND & OPERAT ENGN ANN ARBOR MI 48109 USA UNIV WINDSOR DEPT MATH & STAT WINDSOR N9B 3P4 ONTARIO CANADA ERASMUS UNIV ROTTERDAM DEPT OPERAT RES 3000 DR ROTTERDAM NETHERLANDS ERASMUS UNIV ROTTERDAM TINBERGEN INST 3000 DR ROTTERDAM NETHERLANDS

Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, the expected number of function evaluations needed to arbitrarily well approximate the optimal solution is at most O(n5/2) where n is the dimension of the problem. Improving Hit-and-Run when applied to global optimization problems can therefore be expected to converge polynomially fast as it approaches the global optimum.

关键词： RANDOM SEARCH MONTE-CARLO OPTIMIZATION algorithm complexity GLOBAL OPTIMIZATION

来源：评论

学校读者我要写书评

暂无评论

Fractional-Order Water Flow Optimizer

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2024年第1期17卷 1-27页

作者： Tang, Zhentao Wang, Kaiyu Zang, Yan Zhu, Qianyu Todo, Yuki Gao, Shangce Jiangsu Agrianim Husb Vocat Coll Taizhou 225300 Peoples R China Univ Toyama Fac Engn Toyama 9308555 Japan Kanazawa Univ Fac Elect Informat & Commun Engn Kanazawa 9201192 Japan

The water flow optimizer (WFO) is the latest swarm intelligence algorithm inspired by the shape of water flow. Its advantages of simplicity, efficiency, and robust performance have motivated us to further enhance it. In this paper, we introduce fractional-order (FO) technology with memory properties into the WFO, called fractional-order water flow optimizer (FOWFO). To verify the superior performance and practicality of FOWFO, we conducted comparisons with nine state-of-the-art algorithms on benchmark functions from the IEEE Congress on Evolutionary Computation 2017 (CEC2017) and four real-world optimization problems with large dimensions. Additionally, tuning adjustments were made for two crucial parameters within the fractional-order framework. Finally, an analysis was performed on the balance between exploration and exploitation within FOWFO and its algorithm complexity.

关键词： Fractional order Memory properties Water flow optimizer Practicality Exploration and exploitation algorithm complexity

来源：评论

学校读者我要写书评

暂无评论

OPTIMUM SOFT-DECODING OF LINEAR BLOCK-CODES .2. ANALYSIS AND SIMULATION RESULTS

引用

ANNALS OF TELECOMMUNICATIONS 1986年第11-12期41卷 580-604页

作者： BATTAIL, G FANG, J 1.Département Systèmes et Communications Ecole nationale supérieure des télécommunications 46 rue Barrault 75634 Paris cedex 13

Les auteurs se proposent d’étudier la complexité d’un algorithme de décodage pondéré des codes linéaires en blocs précédemment publié et de certaines de ses variantes sim... 详细信息

Les auteurs se proposent d’étudier la complexité d’un algorithme de décodage pondéré des codes linéaires en blocs précédemment publié et de certaines de ses variantes simplifiées, en se restreignant au cas binaire. On présente à cet effet des calculs basés sur un modèle simplifié du fonctionnement du décodeur ainsi que des résultats de sa simulation. On commence par rappeler la description de cet algorithme en se référant au diagramme du treillis associé au code. Une description probabiliste du fonctionnement de l’algorithme sert d’introduction à un modèle dans lequel les ?cotes? associées à chaque chemin du treillis, qu’il s’agit de comparer, sont scindées en deux termes additifs, l’un certain, l’autre aléatoire. Une évaluation de la complexité de l’algorithme optimal et de certaines de ses variantes simplifiées est développée à partir de ce modèle. La méthode de simulation de l’algorithme et de ses variantes, ainsi que les résultats obtenus, sont enfin présentés.

关键词： Code bloc Code linéaire Décodage algorithme optimal Pondération Simulation numérique Complexité algorithme Code binaire Modèle stochastique Block code Linear code Decoding Optimal algorithm Weighting Digital simulation algorithm complexity Binary code Stochastic model

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT algorithmS FOR AGGLOMERATIVE HIERARCHICAL-CLUSTERING METHODS

引用

JOURNAL OF CLASSIFICATION 1984年第1期1卷 7-24页

作者： DAY, WHE EDELSBRUNNER, H GRAZ TECH UNIV INST INFORMAT VERARBEITUNGA-8010 GRAZAUSTRIA

Whenevern objects are characterized by a matrix of pairwise dissimilarities, they may be clustered by any of a number of sequential, agglomerative, hierarchical, nonoverlapping (SAHN) clustering methods. These SAHN clustering methods are defined by a paradigmatic algorithm that usually requires 0(n ³) time, in the worst case, to cluster the objects. An improved algorithm (Anderberg 1973), while still requiring 0(n ³) worst-case time, can reasonably be expected to exhibit 0(n ²) expected behavior. By contrast, we describe a SAHN clustering algorithm that requires 0(n ² logn) time in the worst case. When SAHN clustering methods exhibit reasonable space distortion properties, further improvements are possible. We adapt a SAHN clustering algorithm, based on the efficient construction of nearest neighbor chains, to obtain a reasonably general SAHN clustering algorithm that requires in the worst case 0(n ²) time and space.

关键词： algorithm complexity algorithm design Centroid clustering method Geometric model SAHN clustering method

来源：评论

学校读者我要写书评

暂无评论

INVESTIGATION OF PROPORTIONAL LINK LINKAGE CLUSTERING METHODS

引用

JOURNAL OF CLASSIFICATION 1985年第2-3期2卷 239-254页

作者： DAY, WHE EDELSBRUNNER, H GRAZ TECH UNIV INST INFORMATIONSVERARBEITUNG A-8010 GRAZ AUSTRIA

Proportional link linkage (PLL) clustering methods are a parametric family of monotone invariant agglomerative hierarchical clustering methods. This family includes the single, minimedian, and complete linkage clustering methods as special cases;its members are used in psychological and ecological applications. Since the literature on clustering space distortion is oriented to quantitative input data, we adapt its basic concepts to input data with only ordinal significance and analyze the space distortion properties of PLL methods. To enable PLL methods to be used when the number n of objects being clustered is large, we describe an efficient PLL algorithm that operates in O(N2 log n) time and O(n2) space.

关键词： algorithm complexity algorithm design Integer link linkage clustering method Monotone invariance SAHN clustering method Space distortion

来源：评论

学校读者我要写书评

暂无评论

DEADLOCK-FREE SYSTEMS FOR A BOUNDED NUMBER OF PROCESSES

引用

IEEE TRANSACTIONS ON COMPUTERS 1982年第3期31卷 188-195页

作者： IBARAKI, T KAMEDA, T SIMON FRASER UNIV DEPT COMP SCIBURNABY V5A 1S6BCCANADA

Consider a computer system in which different types of serially reusable resources are shared by several classes of processes. We assume that each process in a process class has the same known maximum claim (i.e., the maximum resource requirement), but that the actual sequence of requests is unknown. Our resource manager uses the "expedient policy" in granting requests for resources, under the constraint that at most K (a constant) processes can reside in the system at any time.

关键词： algorithm complexity NP-complete deadlock deadlock prevention operating system resource allocation

来源：评论

学校读者我要写书评

暂无评论

N-Step Sliding Recursion Formula of Variance and Its Implementation

引用

JOURNAL OF INFORMATION PROCESSING SYSTEMS 2020年第4期16卷 832-844页

作者： Yu, Lang He, Gang Mutahir, Ahmad Khwaja Southwest Univ Sci & Technol Sch Sci Mianyang Sichuan Peoples R China Southwest Univ Sci & Technol Sch Comp Sci & Technol Mianyang Sichuan Peoples R China

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

关键词： algorithm complexity Multi-Step Recursion algorithm Sliding Window Variance

来源：评论

学校读者我要写书评

暂无评论

FINITELY GENERATED STRUCTURES COMPUTABLE IN POLYNOMIAL TIME

引用

SIBERIAN MATHEMATICAL JOURNAL 2022年第5期63卷 801-818页

作者： Alaev, P. E. Sobolev Inst Math Novosibirsk Russia

We give some simple description for the finitely generated structures with P-computable isomorphic presentation;i.e., presentation computable in polynomial time. The description is close to the formulation of a Remmel and Friedman theorem. We prove that each finitely generated substructure of a P-computable structure also has a P-computable presentation. The description is applied to the classes of finitely generated semigroups, groups, unital commutative rings and fields, as well as ordered unital commutative rings and fields. We prove that every finitely generated commutative ring or a field has a P-computable presentation.

关键词： computable structure polynomial computability algorithm complexity semigroup group ring field

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL-algorithmS FOR COMPARING TREES WITH LABELED LEAVES

引用

JOURNAL OF CLASSIFICATION 1985年第1期2卷 7-28页

作者： DAY, WHE MEM UNIV NEWFOUNDLAND DEPT COMP SCI St John A1C 5S7 NEWFOUNDLAND CANADA

Let Rn denote the set of rooted trees with n leaves in which the leaves are labeled by the integers in { 1, . . . , n};and among interior vertices only the root may have degree 2. Associated with each interior vertex v in such a tree is the subset, or cluster, of leaf labels in the subtree rooted at v. Cluster {1, . . . , n} is called trivial. Clusters are used in quantitative measures of similarity, dissimilarity and consensus among trees. For any k trees in Rn, the strict consensus tree C(T1, . . . , Tk) is that tree in Rn containing exactly those clusters common to every one of the k trees. Similarity between trees T1 and T2 in Rn is measured by the number S(T1, T2) of nontrivial clusters in both T1 and T2;dissimilarity, by the number D(T1, T2) of clusters in T1 or T2 but not in both. algorithms are known to compute C(T1, . . . , Tk) in O(kn2) time, and S(T1, T2) and D(T1, T2) in O(N2) time. A special representation of the clusters of any tree T in Rn, is proposed that permits testing in constant time whether a given cluster exists in T. algorithms are described that exploit this representation to compute C(T1, . . . , Tk) in O(kn) time, and S(T1, T2) and D(T1, T2) in O(n) time. These algorithms are optimal in a technical sense. They enable well-known indices of consensus between 2 [phylogenetic] trees to be computed in O(n) time. All these results apply as well to comparable problems involving unrooted trees with labeled leaves.

关键词： algorithm complexity algorithm design Comparing hierarchical classifications Comparing phylogenetic trees Consensus index Strict consensus tree

来源：评论

学校读者我要写书评

暂无评论

Third-order complex delta-sigma modulator with arbitrary poles and zeros placement

引用

ELECTRONICS LETTERS 2020年第2期56卷 71-72页

作者： Li, Chuan You, Fei Wang, Jinchen Huang, Jiajun He, Songbai Univ Elect Sci & Technol China Sch Elect Sci & Engn Chengdu 611731 Peoples R China

A third-order complex delta-sigma modulation (CDSM) structure with cross-coupling paths is proposed and analysed. Although the conventional CDSM can reduce circuits complexity in digital transmitter systems, it suffers from other shortcomings like increasing algorithm complexity. This structure imports cross-coupling paths both at output and interstage, which realises decorrelation between zeros and poles. The advantage is that complex zeros can be arbitrarily placed, and thus, the reconfigurable digital wireless transmitter application can be satisfied;and the poles are not affected by zeros placement, which improves the flatness of signal transfer function.

关键词： delta-sigma modulation transfer functions circuit complexity poles and zeros zeros placement third-order complex delta-sigma modulation structure conventional CDSM circuits complexity digital transmitter systems algorithm complexity cross-coupling paths complex zeros reconfigurable digital wireless transmitter application arbitrary poles and zeros placement third order complex delta-sigma modulator CDSM structure signal transfer function

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：