Ratewise-optimal non-sequential search strategies under constraints on the tests
نویسنده
چکیده
Already in his Lectures on Search Renyi suggested to consider a search problem, where an unknown x ∈ X = {1, 2, . . . , n} is to be found by asking for containment in a minimal number m(n, k) of subsets A1, . . . , Am with the restrictions |Ai| ≤ k < n2 for i = 1, 2, . . . ,m. Katona gave in 1966 the lower bound m(n, k) ≥ log n h( k n) in terms of binary entropy and the upper bound m(n, k) ≤ ⌈
منابع مشابه
Generalized Voronoi Partition Based Multi-Agent Search using Heterogeneous Sensors
In this paper we propose search strategies for heterogeneous multi-agent systems. Multiple agents, equipped with communication gadget, computational capability, and sensors having heterogeneous capabilities, are deployed in the search space to gather information such as presence of targets. Lack of information about the search space is modeled as an uncertainty density distribution. The uncerta...
متن کاملOptimal Capacitor Allocation in Radial Distribution Networks for Annual Costs Minimization Using Hybrid PSO and Sequential Power Loss Index Based Method
In the most recent heuristic methods, the high potential buses for capacitor placement are initially identified and ranked using loss sensitivity factors (LSFs) or power loss index (PLI). These factors or indices help to reduce the search space of the optimization procedure, but they may not always indicate the appropriate placement of capacitors. This paper proposes an efficient approach for t...
متن کاملOPTIMALITY ANALYSIS OF SEQUENTIAL PROBABILITY RATIO TEST Strictly Optimal Sequential Tests
The sequential probability ratio test (SPRT) is asymptotically optimal in the speed versus accuracy tradeoff (SAT) for problems such as visual search (Ch. 3) and scotopic object recognition (Ch. 4), but how close to optimal is SPRT in the nonasymptotic case, i.e. when the cost of error η or the expected response time is small? We numerically compare SPRT and the optimal strategy on the homogene...
متن کاملSequential Detection with Limited Memory
Sequential tests outperform fixed sample size tests by requiring fewer samples on average to achieve the same level of error performance. The Sequential Probability Ratio Test (SPRT) has been suggested by Wald [1] for sequential binary hypothesis testing problems. SPRT recursively calculates the likelihood of an observed data stream and requires this likelihood to be stored in memory between sa...
متن کاملImpact of Participants’ Market Power and Transmission Constraints on GenCos’ Nash Equilibrium Point
Unlike perfect competitive markets, in oligopoly electricity markets due to strategic producers and transmission constraints GenCos may increase their own profit through strategic biddings. This paper investigates the problem of developing optimal bidding strategies of GenCos considering participants’ market power and transmission constraints. The problem is modeled as a bi-level optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 156 شماره
صفحات -
تاریخ انتشار 2008