(\alpha, \beta) Fibonacci Search
نویسنده
چکیده
Knuth [12, Page 417] states that “the (program of the) Fibonaccian search technique looks very mysterious at first glance” and that “it seems to work by magic”. In this work, we show that there is even more magic in Fibonaccian (or else Fibonacci) search. We present a generalized Fibonacci procedure that follows perfectly the implicit optimal decision tree for search problems where the cost of each comparison depends on its outcome.
منابع مشابه
A Multi Objective Fibonacci Search Based Algorithm for Resource Allocation in PERT Networks
The problem we investigate deals with the optimal assignment of resources to the activities of a stochastic project network. We seek to minimize the expected cost of the project include sum of resource utilization costs and lateness costs. We assume that the work content required by the activities follows an exponential distribution. The decision variables of the model are the allocated resourc...
متن کاملConceptual framework for performing simultaneous fold and sequence optimization in multi-scale protein modeling
We present a dual optimization concept of predicting optimal sequences as well as optimal folds of off-lattice protein models in the context of multi-scale modeling. We validate the utility of the recently introduced hidden-force Monte Carlo optimization algorithm by finding significantly lower energy folds for minimalist and detailed protein models than previously reported. Further, we also fi...
متن کاملRollout-based Game-tree Search Outprunes Traditional Alpha-beta
Recently, rollout-based planning and search methods have emerged as an alternative to traditional tree-search methods. The fundamental operation in rollout-based tree search is the generation of trajectories in the search tree from root to leaf. Game-playing programs based on Monte-Carlo rollouts methods such as “UCT” have proven remarkably effective at using information from trajectories to ma...
متن کاملBest-First and Depth-First Minimax Search in Practice
Most practitioners use a variant of the Alpha-Beta algorithm, a simple depth-first procedure, for searching minimax trees. SSS*, with its best-first search strategy, reportedly offers the potential for more efficient search. However, the complex formulation of the algorithm and its alleged excessive memory requirements preclude its use in practice. For two decades, the search efficiency of “sma...
متن کاملSearch techniques, Fibonacci lengths and centro-polyhedral groups
For a finitely generated group G = 〈A〉 where A = {a1, a2, . . . , an} the sequence xi = ai+1, 0 ≤ i ≤ n − 1, xi+n = ∏n j=1 xi+j−1, i ≥ 0, is called the Fibonacci orbit of G with respect to the generating set A, denoted FA(G). If FA(G) is periodic, we call the length of the period of the sequence the Fibonacci length of G with respect to A, written LENA(G). We examine the Fibonacci lengths of al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1012.0259 شماره
صفحات -
تاریخ انتشار 2010