A new algorithm is described to compute the transitive closure of a circuit-free graph, the complexity of which (in the worst-case sense) is better than O(MN) (M being the number of arcs and N the number of vertices). In the case of low density graphs, the resulting complexity is ...
方法:Recurrent Computational Graph + 遗传算法来解决最优合成问题optimal program synthesis 实验: 可以有效地发现各种算法的最坏复杂性 更具有可拓展性 可以在google Guava和JGraphT等程序中发现未知的性能错误和可用性漏洞 1. Intro worst-case complexity analysis, worst performance inputs(WPIs)可以用来debug perfor...
The application of this work is finding performance related security bugs: if the actual complexity of an algorithm does not match the theoretical complexity, then an adversary can potentially deny service to benign users by sending input that triggers the worst-case complexity. Such inputs can ...
In this work, we address this problem and propose efficient disjunctive and boolean SSE schemes with worst-case sub-linear search complexity and optimal communication overhead. Our schemes are non-interactive and, as far as we know, the first to achieve optimal communication complexity. To do thi...
it is equivalent to say that the link dependency graph is acyclic and that the network is deadlock-free. Since deadlock prone networks would not be valid for satellite use, Theorem 1 shows that the computation finishes in every pertinent case. This is also coherent with the fact that, when...
A Simple Algorithm for Finding a Maximum Clique and Its Worst‐Case Time Complexity This paper proposes a new algorithm MAXCLIQUE which finds a maximum clique in an undirected graph with n vertices, and shows that its worst-case time com... M Shindo,E Tomita - 《Systems & Computers in Jap...
While for some branch and bound algorithms a worst case complexity bound is known, the average case complexity is usually unknown despite the fact that ... DR Smith 被引量: 15发表: 1979年 Robust Regression using Maximum-Likelihood Weighting and Assuming Cauchy-Distributed Random Error. Actual wei...
WorstCase Optimal Redistribution of VCG Payments最坏情况下的最优分配VCG支付.ppt,Complexity of unweighted coalitional manipulation under some common voting rules Voting Manipulation Manipulation: a voter (manipulator) casts a vote that is not her true pre
COMPUTING THE WORST CASE EXECUTION TIME OF AN AVIONICS PROGRAM BY ABSTRACT INTERPRETATION Jean Souyris* (jean.souyris@airbus.com), Erwan Le Pavec* (erwan.lepavec@airbus.com), Guillaume Himbert* (guillaume.himbert@airbus.com), Victor Jégu* (victor.jegu@airbus.com), Guillaume Borios** (...
31. 試問下圖是否為雙分圖(bipartite graph) ?試求出他的最大配對(maximum matching)和最小覆蓋(minimum covering)。 (a) (b) (c) (d) 1* 0 0 0 0 1* 0 0 0 0 1* 0 1 0 0 1* 0 0 1 0 0 0 0 1 1 0 0 1 0 1* 1 0 0 1 0 0...