Bound for Worst Case Error Across Region
An Error Bound Based on a Worst Likely Assignment
... An error bound based on VC dimension (Vapnik and Chervonenkis, 1971; Vapnik, 1998) uses uni- form bounds over the largest number of assignments possible from a class of classifiers, based on ...
33
Worst-Case Bound Analysis for the Time-Critical MAC behaviors of IEEE 802.15.4e
... a DSME network can be increased using effective techniques such as CAP reduction. Using CAP reduction technique, the CAP region of a superframe can be completely eliminated and be replaced with a CFP ...
11
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
... 4.2. “Typicality” of the execution rate of faulty code blocks It is assumed that the execution rates of faults are “typical”, i.e. are drawn randomly from the execution rate profile of program blocks. This would imply ...
10
Using a Log-normal Failure Rate Distribution for Worst Case Bound Reliability Prediction
... 4.2. “Typicality” of the execution rate of faulty code blocks It is assumed that the execution rates of faults are “typical”, i.e. are drawn randomly from the execution rate profile of program blocks. This would imply ...
9
Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
... the worst case complexity of general trust-region derivative-free methods for smooth ...non-smooth case, we propose a smooth- ing approach, for which we prove global convergence and ...
27
Trust-Region Methods without using Derivatives: Worst-Case Complexity and the Non-Smooth Case
... The derivative-free trust-region framework of [22] described in Section 2.3 has been used by several authors. Billups, Larson, and Graf [8] first extended the theory developed for quadratic polynomial regression ...
96
Roundness: A closed form upper bound for the centroid to minimum zone center distance by worst-case analysis
... As anticipated in the introduction, not all the minimum zone methods are based on the minimum zone center C MZ to determine the minimum zone roundness error and are able to provide its position. From our extensive ...
23
Global Continuous Optimization with Error Bound and Fast Convergence
... if f (x + i ) ≥ f (x + i−1 ), and k = max(j − 1, 1) otherwise, where W j is the previous parameter value w before this adjustment occurs. Intuitively, this adaptive procedure is to encourage the algorithm to be locally ...
43
Worst-Case TCAM Rule Expansion
... For additional simulations, please refer to [20]. VII. C ONCLUSION This paper is unique in that it deals with the fundamental capacity region of TCAMs. In the paper, we presented new upper-bounds on the TCAM ...
5
Meta-Analysis of Linkage Data under Worst-Case Conditions: A Demonstration Using the Human OB Region
... Recently, several authors have suggested the possibil- ity of developing methods for meta-analysis of linkage studies. L ander and K ruglyak (1995, p. 245) state “careful meta-analysis of all studies may be useful to as- ...
7
Exact Worst-Case TCAM Rule Expansion
... X. C ONCLUSION This paper is unique in that it deals with the fundamental capacity region of TCAMs. In the paper, we presented new upper-bounds on the TCAM worst-case rule expansions. In particular, ...
13
Proofs of Work from Worst-Case Assumptions
... distributed across many worker in way that is robust to Byzantine error, both of which are properties seemingly not achievable from the current ‘structureless’ heuristic PoWs that are ...
30
A worst-case bound for topology computation of algebraic curves
... Refining all the I i to size ε takes O ˜ ( d 3 λ 2 + d 2 L ε )) = ˜ O ( d 3 λ 2 + d 2 L δ )) bit operations, by Theorem 17, which is the desired bound. It is left to argue why the interval evaluation and the ...
20
Improved bound on the worst case complexity of Policy Iteration
... Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found in polynomial time using Linear ...
11
Data Sampling and Error bound
... an error bound, thereby reducing the query’s execution ...(1) error bounds are dictated by end users and cannot be compromised, (2) data is sparse, meaning data has a limited population but a wide ...
12
Error Bound of Periodic Signals in the Hölder Metric
... the error bound between input periodic signals and processed output signals, whenever signals belong to H ω -space and as a processor we have taken C, 1 E, 1 - mean and generalized an early result of Lal ...
9
Selecting the Worst-Case Portfolio
... Figure 4.2 JAVA output: Summary of results, Margin Ratio comparison of Criteria 2 and 3, 10,000 randomized order books of size 10. Appendix The results are revealing. While not in consensus every time, Criteria 2 and 3 ...
74
CiteSeerX — Worst-case equilibria
... It is nontrivial to arrive at a compelling mathematical formulation of this question. Independent, non-cooperative agents obviously evoke game theory 8], and its main concept of rational behavior, the Nash equilibrium: ...
10
WORST CASE INSTANCES ARE FRAGILE
... While Spielman and Teng introduced smoothed complexity having the running time of an algorithm as performance criteria in mind, it also makes sense to apply smoothed complexity to other criteria. In this thesis, we ...
125
Higher order error bound for the difference of two functions
... error bounds for DC functions in R n . In 2014, Huang and Li [9] studied error bounds for DC multifunctions. In 2016, Van Hang and Yao [10] established sufficient conditions for the existence of error ...
9