A Note On Lookahead In Real Life And Computing (2403.17942v1)
Abstract: Past, Present and Future are considered to be three temporal and logical concepts which are well defined by human beings for their existence and growth. We, as human beings, have the privilege of using our intelligence to mentally execute an activity before physical occurrence of the same in the real world. Knowledge of the past, aplomb of present and visualisation for the future correspond to three concepts such as look-back, look-at and look-ahead respectively in real life as well as in diversified domains of computing. Look-Ahead(LA) deals with the future prediction of information and processing of input to produce the output in advance. In this article, our main objective is to learn, understand and explore the concept of LA and design novel models as solution for real world problems. We present three well known algorithmic frameworks used in practice based on availability of input information such as offline, online and semi-online. We introduce interesting real life applications and well known computing problems where LA plays a significant role for making a process, system or algorithm efficient. We define new types of LA and propose a taxonomy for LA based on literature review for designing novel LA models in future. Using the concept of LA, We identify and present many interesting and non-trivial research challenges as future potential research directions. Intuitively, we observe that LA can be used as a powerful tool and framework for future researchers in design of efficient computational models and algorithms for solving non-trivial and challenging optimization problems.
- On the power of lookahead in online lot-sizing. Operations Research Letters, 38(6):522–526, 2010.
- Susanne Albers. A competitive analysis of the list update problem with lookahead. Theoretical Computer Science, 197(1-2):95–109, 1998.
- Tight bounds for online coloring of basic graph classes. Algorithmica, 83(1):337–360, 2021.
- On the power of lookahead in on-line server routing problems. Theoretical Computer Science, 408(2-3):116–128, 2008.
- On the power of lookahead in on-line vehicle routing problems. In International Computing and Combinatorics Conference, pages 728–736. Springer, 2005.
- El-Yaniv Bachrach and Reinstädtler. On the competitive theory and practice of online list accessing algorithms. Algorithmica, 32:201–245, 2002.
- Online computation and competitive analysis. cambridge university press, 2005.
- The relative worst order ratio for online algorithms. ACM Transactions on Algorithms (TALG), 3(2):22–es, 2007.
- Dany Breslauer. On competitive on-line paging with lookahead. In Annual Symposium on Theoretical Aspects of Computer Science, pages 593–603. Springer, 1996.
- Benjamin J Coleman. Lookahead scheduling in a real-time context: Models, algorithms, and analysis. The College of William and Mary, 2004.
- Fabian Dunke. Online optimization with lookahead. PhD thesis, Karlsruhe, Karlsruher Institut für Technologie (KIT), Diss., 2014.
- Semi-online scheduling with lookahead. arXiv preprint arXiv:2306.06003, 2023.
- Edward F Grove. Online bin packing with lookahead. In Proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms, pages 430–436, 1995.
- Design of a well-behaved algorithm for on-board look-ahead control. IFAC Proceedings Volumes, 41(2):3350–3355, 2008.
- Self-organizing linear search. ACM Computing Surveys (CSUR), 17(3):295–311, 1985.
- Lookahead optimizer: k steps forward, 1 step back. 2019.
- Rakesh Mohanty. Studies on the List Update Problem. PhD Thesis, IIT, Madras, 2014.
- Look-ahead approaches for integrated planning in public transportation. In 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.
- Warren B Powell. Designing lookahead policies for sequential decision problems in transportation and logistics. IEEE Open Journal of Intelligent Transportation Systems, 3:313–327, 2022.
- Off-line algorithms for the list update problem. Information Processing Letters, 60(2):75–80, 1996.
- Optimum off-line algorithms for the list update problem. Yale University, Department of Computer Science, 1990.
- On lookahead in the list update problem. Information processing letters, 50(2):105–110, 1994.
- Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3):652–686, 1985.
- Look-ahead routing and message scheduling in delay-tolerant networks. Computer Communications, 34(18):2184–2194, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.