We improve on this by providing an algorithm with at most (k+1+C)n+{O}(k^3) comparisons for some constant C. The known lower bounds are of the form (k + 1 + c )n - D, for some constant D, where c = 0.5, c_1=23/32= 0.71875, and c_k={Ω}(2^{-5k/4}) as k→ ...
It is argued that the present methods are preferable to his, and a counterexample to his argument is presented. An algorithm which enables rapid calculation of the likelihood of a phylogeny is described. 展开 关键词: Evolutionary trees maximum likelihood ...
a left detector and a right detector. I am working on an algorithm to find the maximum white value, so when the detector gets down to that value it will trigger white, and a minimum black value that will trigger black when it gets up to that value. ...
and a maximum-and-minimum-preserving limiter. First, the solution remapping formula is used to remap the solution of the current shape into a piecewise polynomial on the mesh of the new shape. Then the piecewise polynomial is constrained with the maximum-and-minimum-preserving limiter. The ...
Due to the limitation of the CSMA/CD algorithm, an Ethernet frame must be longer than or equal to a specified length. On the Ethernet, the minimum frame length is 64 bytes, which is determined jointly by the maximum transmission distance and the collision detection mechanism. The use of ...
As evaluation reference, a high-resolution gridded dataset of daily maximum and minimum temperatures (Tmin/Tmax) for Africa (covering the period 2008-2010) is created using the regression-kriging-regression-kriging (RKRK) algorithm. RKRK applies, among other predictors, the remotely sensed ...
Minimum/maximum autocorrelation factor (MAF) is a suitable algorithm for orthogonalization of a vector random field. Orthogonalization avoids the use of mu... JA Vargas-Guzmán,R Dimitrakopoulos - 《Computers & Geosciences》 被引量: 56发表: 2003年 Statistical shape analysis using non-Euclidean metr...
F. Ballestin, A genetic algorithm for the resource renting problem with minimum and maximum time lags, Lecture Notes in Computer Science 4446 (2007) 25-35.Ballestin, F. 2007. "A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags." Lecture Notes in ...
time algorithm for this case; further, if all sensors are initially located on the coverage segment, our algorithm takes \(o(n)\) time. also, we extend our techniques to the cycle version of the problem where the barrier coverage is for a simple cycle and the sensors are allowed to ...
In terms of the lowest cost in the optimization of inventory and transportation in a supply chain,this study applies the restriction on distribution cycle,namely the maximum and minimum delivery cycle,and investigates the optimization model to reduce supply chain cost,namely the minimum and maximum ...