Results 221 to 230 of about 323,365 (265)

An optimization method for railway alignment schemes based on game-theoretic combination weighting and an interval number model. [PDF]

Sci Rep
Yang D, Han F, Gao Y, Li Z.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

COLLABORATIVE OPTIMIZATION WITH DIMENSION REDUCTION

International Journal of Modeling, Simulation, and Scientific Computing, 2010
Collaborative optimization (CO) method is widely used in solving multidisciplinary design optimization (MDO) problems, yet its computation requirement has been an obstacle to the applications, leading to doubts about CO's convergence property. The feasible domain of CO problem is first examined and it is proven that feasible domain remains the same ...
Zhenxiao Gao, Tianyuan Xiao, Wenhui Fan
openaire   +1 more source

A Note on Optimal Constant Dimension Codes

International Journal of Foundations of Computer Science, 2015
In this paper, we study bounds for optimal constant dimension codes further. By revising the construction for constant dimension codes in [4], we improve some bounds on q-ary constant dimension codes in some cases. By combinatorial method, we show that there exists no optimal constant dimension code Aq[n, 2δ, k] meeting both Wang-Xing-Safavi-Naini ...
Qunying Liao, Juan Zhu
openaire   +2 more sources

Dimension-by-dimension enhanced cuckoo search algorithm for global optimization

Soft Computing, 2019
Cuckoo search (CS) algorithm is an efficient meta-heuristic algorithm that has been successfully applied in many fields. However, the algorithm uses the whole updating and evaluating strategy on solutions. For solving multi-dimensional optimization problems, solutions with partial dimension evolution may be discarded due to mutual interference among ...
Liang Chen, Houqing Lu, Hongwei Li, Guojun Wang, Li Chen   +4 more
openaire   +1 more source

An Fruit Fly Optimization Algorithm with Dimension by Dimension Improvement

2016
To overcome the shortages of interference phenomena among dimensions, slow convergence rate and low accuracy, a new fruit fly optimization algorithm with dimension by dimension improvement is proposed. In addition, in order to speed up the algorithm convergence rate and avoid algorithm falling into local optimums, a Levy flight mechanism is introduced ...
Haiyun Li, Haifeng Li, Kaibin Wei
openaire   +1 more source

Optimal dimensioning of a ring

2001
A ring architecture is of practical interest for a telecommunication operator. It makes it possible to implement automatic protection mechanisms without a substantial increase in cost. This paper deals with the problem of dimensioning a ring a routing its demands such that the total cost of the network is minimized.
W. Ben-Ameur, S. Besiktasliyan, B. Decocq   +2 more
openaire   +1 more source

OPTIMAL GOSSIPING ON CCCs OF EVEN DIMENSION

Parallel Processing Letters, 2003
A heuristic has shown that the results achieved by earlier algorithms for gossiping on cube-connected-cycles (CCCs) in the unit-cost telephone model were not optimal, but no general pattern was revealed. In this paper new gossiping algorithms are presented that apply to CCCs of all sizes.
Jop F. Sibeyn, Michal Soch
openaire   +1 more source