منابع مشابه
Finding the maximum and minimum elements with one lie
In this paper we deal with the problem of nding the smallest and the largest elements of an ordered set of size n using pairwise comparisons if one of the comparisons might be erroneous and prove a conjecture of Aigner stating that the minimum number of comparisons needed is 87n 32 + c for some constant c. We also address some related problems.
متن کاملMaximum Load and Minimum Volume Structural Optimization
A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is als...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملFinding the Maximum and Minimum Magnitude Responses (Gains) of Third-Order Filters without Calculus
The maximum and minimum gains (with respect to frequency) of third-order low-pass and high-pass filters are derived without using calculus. Our method uses the little known fact that extrema of cubic functions can easily be found by purely algebraic means. PSpice simulations are provided that verify the theoretical results.
متن کاملLower bounds for finding the maximum and minimum elements with k lies
In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size n using pairwise comparisons if k of the comparisons might be erroneous where k is a fixed constant. We prove that at least (k+ 1.5)n+Θ(k) comparisons are needed in the worst case thus disproving the conjecture that (k+1+ )n comparisons are enough.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00012-1