发布求助
文献互助 智能选刊 最新文献

Handbook of Approximation Algorithms and Metaheuristics最新文献

筛选
英文 中文
Local Ratio 当地的比率
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781351236423-6
Dror Rawitz
{"title":"Local Ratio","authors":"Dror Rawitz","doi":"10.1201/9781351236423-6","DOIUrl":"https://doi.org/10.1201/9781351236423-6","url":null,"abstract":"","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"128 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121096549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differential Ratio Approximation 微分比近似
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch16
G. Ausiello, V. Paschos
{"title":"Differential Ratio Approximation","authors":"G. Ausiello, V. Paschos","doi":"10.1201/9781420010749.ch16","DOIUrl":"https://doi.org/10.1201/9781420010749.ch16","url":null,"abstract":"","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121112369","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review 多目标组合优化中的随机局部搜索算法综述
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781351236423-24
L. Paquete, T. Stützle
{"title":"Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: A Review","authors":"L. Paquete, T. Stützle","doi":"10.1201/9781351236423-24","DOIUrl":"https://doi.org/10.1201/9781351236423-24","url":null,"abstract":"","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129770809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Digital Reputation for Virtual Communities 虚拟社区的数字声誉
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch85
R. Battiti, Anurag Garg
{"title":"Digital Reputation for Virtual Communities","authors":"R. Battiti, Anurag Garg","doi":"10.1201/9781420010749.ch85","DOIUrl":"https://doi.org/10.1201/9781420010749.ch85","url":null,"abstract":"In this report we provide an overview of digital reputation management systems for virtual communities. We begin with a discussion on the how trust is created in the real world. We then highlight how the process of trust creation differs in the virtual world. Next, we talk about the different ways in which digital reputations are useful to virtual communities such as incentivizing cooperation and punishing malicious users, providing recommendations or as a form of distributed authentication. We then discuss how evolutionary biology and game theory have informed research in reputation systems. This is followed by a discussion of the various components of reputation such as context, the forms of evidence, first and second order reputation and architectural considerations including the role of distributed hash tables in decentralized reputation management systems. We conclude with a discussion of some reputation management systems such as complaints-based trust, EigenTrust, PeerTrust and ROCQ.","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134248346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Approximation Algorithms and Heuristics for Classical Planning 经典规划的逼近算法和启发式
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch47
J. Frank, A. Jónsson
{"title":"Approximation Algorithms and Heuristics for Classical Planning","authors":"J. Frank, A. Jónsson","doi":"10.1201/9781420010749.ch47","DOIUrl":"https://doi.org/10.1201/9781420010749.ch47","url":null,"abstract":"Automated planning has been an active area of research in theoretical computer science and Artificial Intelligence (AI) for over 40 years. Planning is the study of general purpose algorithms that accept as input an initial state, a set of desired goal states, and a planning domain model that describes how actions can transform the state. The problem is to find a sequence of actions that transforms the initial state into one of the goal states. Planning is widely applicable, and has been used in such diverse application domains as spacecraft control [MNPW98], planetary rover operations [BJMR05], automated nursing aides [MP02], image processing [GPNV03], computer security [BGHH05] and automated manufacturing [RDF05]. Planning is also the subject of continued and lively ongoing research. In this chapter, we will present an overview of how approximations and related techniques are used in automated planning. We focus on classical planning problems, where states are conjunctions of propositions, all state information is known to the planner, and all action outcomes are deterministic. Classical planning is nonetheless a large problem class that generalizes many combinatorial problems including bin-packing ∗Universities Space Research Association †The authors gratefully acknowledge Sailesh Ramakrishnan, Ronen Brafman and Michael Freed for reviewing our early drafts","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"33 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131990455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Approximation Algorithms via LP-Duality and Randomization 基于lp对偶和随机化的分布式逼近算法
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch13
A. Panconesi, F. Grandoni, Devdatt P. Dubhashi
{"title":"Distributed Approximation Algorithms via LP-Duality and Randomization","authors":"A. Panconesi, F. Grandoni, Devdatt P. Dubhashi","doi":"10.1201/9781420010749.ch13","DOIUrl":"https://doi.org/10.1201/9781420010749.ch13","url":null,"abstract":"The spread of computer networks, from sensor networks to the Internet, creates an ever-growing need for efficient distributed algorithms. In such scenarios, familiar combinatorial structures such as spanning trees and dominating sets are often useful for a variety of tasks. Others, like maximal independent sets, turn out to be a very useful primitive for computing other structures. In a distributed setting, where transmission of messages can be orders of magnitude slower than local computation, the expensive resource is communication. Therefore, the running time of an algorithm is given by the number of communication rounds that are needed by the algorithm. This will be made precise below.","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123912842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Prize-Collecting Traveling Salesman and Related Problems 获奖旅行推销员及相关问题
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch40
A. Marchetti-Spaccamela, V. Bonifaci, S. Leonardi, G. Ausiello
{"title":"Prize-Collecting Traveling Salesman and Related Problems","authors":"A. Marchetti-Spaccamela, V. Bonifaci, S. Leonardi, G. Ausiello","doi":"10.1201/9781420010749.ch40","DOIUrl":"https://doi.org/10.1201/9781420010749.ch40","url":null,"abstract":"The most general version of the Prize Collecting Traveling Salesman Problem (PCTSP) was first introduced by Balas [8]. In this problem, a salesman has to collect a certain amount of prizes (the quota) by visiting cities. A known prize can be collected in every city. Furthermore, by not visiting a city, the salesman incurs a pecuniary penalty. The goal is to minimize the total travel distance plus the total penalty, while starting from a given city and collecting the quota. The problem generalizes both the Quota TSP, which is obtained when all the penalties are set to zero, and the Penalty TSP (sometimes unfortunately also called PCTSP), in which there is no required quota, only penalties. A special case of the Quota TSP is the k-TSP, in which all prizes are unitary (k is the quota). The k-TSP is strongly tied to the problem of finding a tree of minimum cost spanning any k vertices in a graph, called the k-MST problem. The k-MST and the k-TSP are NP-hard. They have been the subject of several studies for good approximation","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130831251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Reductions That Preserve Approximability 保留近似的缩减
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch15
G. Ausiello, V. Paschos
{"title":"Reductions That Preserve Approximability","authors":"G. Ausiello, V. Paschos","doi":"10.1201/9781420010749.ch15","DOIUrl":"https://doi.org/10.1201/9781420010749.ch15","url":null,"abstract":"We present in this paper a tour d'horizon of the most important approximation-preserving reductions that have strongly influenced research about structure in approximability classes.","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Memetic Algorithms 迷因算法
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch27
Carlos Cotta, P. Moscato
{"title":"Memetic Algorithms","authors":"Carlos Cotta, P. Moscato","doi":"10.1201/9781420010749.ch27","DOIUrl":"https://doi.org/10.1201/9781420010749.ch27","url":null,"abstract":"The term ‘Memetic Algorithms’ [74] (MAs) was introduced in the late 80s to denote a family of metaheuristics that have as central theme the hybridization of different algorithmic approaches for a given problem. Special emphasis was given to the use of a population-based approach in which a set of cooperating and competing agents were engaged in periods of individual improvement of the solutions while they sporadically interact. Another main theme was to introduce problem and instance-dependent knowledge as a way of speeding-up the search process. Initially, hybridizations included Evolutionary Algorithms –EAs [35, 41, 89, 97], Simulated Annealing and its variants [52] [79] and Tabu Search [75] [9]. Today, a number of hybridizations include other metaheuristics [42] as well as exact algorithms, in complete anytime memetic algorithms [76]. These methods not only prove optimality, they can deliver high-quality solutions early on in the process. The adjective ‘memetic’ comes from the term ’meme’, coined by R. Dawkins [30] to denote an analogous to the gene in the context of cultural evolution. It was first proposed as a mean of conveying the message that, although inspiring for many, biological evolution should not constrain the imagination to develop","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129327905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Stability of Approximation 近似的稳定性
Handbook of Approximation Algorithms and Metaheuristics Pub Date : 1900-01-01 DOI: 10.1201/9781420010749.ch31
Hans-Joachim Böckenhauer, S. Seibert, J. Hromkovic
{"title":"Stability of Approximation","authors":"Hans-Joachim Böckenhauer, S. Seibert, J. Hromkovic","doi":"10.1201/9781420010749.ch31","DOIUrl":"https://doi.org/10.1201/9781420010749.ch31","url":null,"abstract":"","PeriodicalId":262519,"journal":{"name":"Handbook of Approximation Algorithms and Metaheuristics","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信