Error-free transformation of matrix product: worst case optimal algorithmK.Ozaki K.OzakiT. OgitaKatsuhisa Ozaki
We provide a generic algorithm for query entailment under gbts, which is worst-case optimal for combined complexity with or without bounded predicate arity, as well as for data complexity and query complexity. Secondly, we classify several gbts classes, whose complexity was unknown, with respect ...
4A Worst-Case Optimal Algorithm Our goal is to evaluate SERVICE-to-API queries as efficiently as possible, which implies minimising the number of API calls we issue when evaluating queries. This takes us to the following question: what is the minimal amount of API calls that need to be issue...
3 A Worst-Case Optimal Algorithm Theorem 3.1Every set of disks with total area {\pi }/{2} can be packed into the unit disk O with radius 1. This induces a worst-case optimal packing density of 1/2, i.e., a ratio of 1/2 between the area of the unit disk and the total area ...
Worst-case optimal join algorithms are the class of join algorithms whose runtime match the worst-case output size of a given join query. While the first provably worst-case optimal join algorithm was discovered relatively recently, the techniques and results surrounding these algorithms grow out of...
We present an optimal Θ()-time algorithm for the selection of a subset of the vertices of an -vertex plane graph so that each of the faces of is covered by (i.e., incident with) one or more of the selected vertices. At most /2 vertices are selected, matching the worst-case requir...
摘要:RPS类流量调度算法由于具有理想的延时性能,在具有QoS要求的调度算法中该类算法被广泛应用。为了使该类算法同时具有较好的公平性,将该算法与流量成形机制相结合(SRPS),即可得到理想的Worst-case公平指数 (WFI)。在现有文献中都认为SRPS算法具有与WF2Q相同WFI,本文在分析RPS算法的基础上,重新给出了SRPSworst-ca...
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
2.In on- line version,the worst-case ratio of LS being 1/m is proved,so LS is the optimal algorithm for this problem.证明了LS算法是求解该问题的最好的在线算法,它的最坏情况界为1/m。 3.For m parallel machines scheduling with two grade of service (GoS) levels,it is shown that the wo...
However no bound better than a naive exponential order one is estalished for the worst-case complexity of the optimal LLL algorithm, even for fixed small dimension (higher than 2). Here we prove that, for any fixed dimension n, the number of iterations of the LLL algorithm is linear with...