{"title":"Weighted online search","authors":"Spyros Angelopoulos , Konstantinos Panagiotou","doi":"10.1016/j.jcss.2023.05.002","DOIUrl":null,"url":null,"abstract":"<div><p>We study the general setting of <em>weighted search</em> in which a number of weighted targets are hidden in a star-like environment, and a mobile searcher must locate a subset of targets with aggregate weight at least a given value <em>W</em>. The cost of the strategy is the distance traversed by the searcher, and its performance is measured by the worst-case ratio of the cost incurred by the searcher over the cost of an on optimal, offline strategy. This is the first study of a setting that generalizes several problems in search theory such as searching for a single target and searching for unit-weighted targets. We present and analyze a near-optimal strategy using an approach based on parameterized analysis. This problem formulates settings of resource allocation among parallel tasks under uncertainty; specifically, we demonstrate further applications in the design of interruptible systems based on <em>adaptive</em> scheduling of contract algorithms.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"138 ","pages":"Article 103457"},"PeriodicalIF":1.1000,"publicationDate":"2023-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000023000557","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
引用次数: 0
Abstract
We study the general setting of weighted search in which a number of weighted targets are hidden in a star-like environment, and a mobile searcher must locate a subset of targets with aggregate weight at least a given value W. The cost of the strategy is the distance traversed by the searcher, and its performance is measured by the worst-case ratio of the cost incurred by the searcher over the cost of an on optimal, offline strategy. This is the first study of a setting that generalizes several problems in search theory such as searching for a single target and searching for unit-weighted targets. We present and analyze a near-optimal strategy using an approach based on parameterized analysis. This problem formulates settings of resource allocation among parallel tasks under uncertainty; specifically, we demonstrate further applications in the design of interruptible systems based on adaptive scheduling of contract algorithms.
期刊介绍：
The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions.
Research areas include traditional subjects such as:
• Theory of algorithms and computability
• Formal languages
• Automata theory
Contemporary subjects such as:
• Complexity theory
• Algorithmic Complexity
• Parallel & distributed computing
• Computer networks
• Neural networks
• Computational learning theory
• Database theory & practice
• Computer modeling of complex systems
• Security and Privacy.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
