This complexity measure has not been investigated very much. In this paper, we characterize the k-binomial complexity of the Thue-Morse word. The result is striking, compared to more familiar complexity functions. Although the Thue-Morse word is aperiodic, its k-binomial complexity eventually ...
At first, we formally define the terms of an online algorithm and its competitive ratio which is usually used to measure the algorithm's output quality in a worst-case fashion. Definition 1 Online Algorithm Consider an input sequence I=(x1,…,xn) for some minimization problem U. An online ...
15.Complexity of periodic sequences S~∞ and ~∞ over F_pF_p上周期序列S~∞与 ~∞的线性复杂度分析 16.On the Measure of Complexity复杂性究竟有多复杂?——论复杂性的测度 17.Complexities and Approximation Algorithms for Facility Location and K-Median Problems;设施选址与K-中间点问题的复杂性与近...
Proof complexity is a research area that studies the concept of complexity from the point of view of logic. In proof complexity, an important question is: "how difficult is it to prove a theorem?" There are various ways that one can measure the complexity of a theorem. We can ask what ...
(1+1) GP using multi-criteria fitness functions that take into account the original objective and the complexity of a syntax tree as a secondary measure... F Neumann - 《Computer Science》 被引量: 38发表: 2012年 A Study on the Use of Multiobjective Genetic Algorithms for Classifier Selectio...
This complexity measure has not been investigated very much. In this paper, we characterize the $k$-binomial complexity of the Thue--Morse word. The result is striking, compared to more familiar complexity functions. Although the Thue--Morse word is aperiodic, its $k$-binomial complexity ...
This is achieved by leveraging established complexity metrics from literature, and combining three complementary ones (i.e. NOAJS, CFC and CNC) to a single weighted measure, offering an integrated scheme for evaluating complexity. K-means clustering algorithm is implemented on 87 eligible models, ...
Conditional Value-at-Risk (CVaR) is used as a quantitative measure of risk that is constrained in the model. Benders' decomposition scheme is utilized to develop a new decomposition algorithm for solving the CVaR constrained maximum 2-club problem. A preliminary experiment is also conducted to ...
To measure the capability of this teleportation primitive, we introduce a quantity called "teleportation depth," which characterizes how many teleportation steps are necessary, on average, to implement a given gate. We calculate upper bounds for teleportation depth by decomposing gates into both semi-...
Distance measureCross-validationIn earlier papers we introduced the measures of pseudorandomness of finite binary sequences [13], introduced the notion of f–complexity of families of binary sequences, constructed large families of binary sequences with strong PR (= pseudorandom) properties [6], [...