This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. It begins with the fundamental theory of black-box optimization and proceeds to guide the reader through recent advances in structural optimization and stochastic optimization. The presentation of ...
出版年:1997-04-11 页数:328 定价:USD 74.95 装帧:Paperback ISBN:9783540625926 豆瓣评分 目前无人评价 评价: 写笔记 写书评 加入购书单 分享到 Algorithms and Complexity的创作者· ··· Daniel P·Bovet作者 我要写书评 Algorithms and Complexity的书评 ···(全部 0 条) 论坛· ··...
Computer science - Algorithms, Complexity, Programming: An algorithm is a specific procedure for solving a well-defined computational problem. The development and analysis of algorithms is fundamental to all aspects of computer science: artificial intell
Algorithms and Complexity Abstract In the ninth century of the Christian era, in a small town in Uzbekistan now called Khiva but then Khowarizm, there lived an Arab mathematician called Abu Ja’far Mohamed ben Musa, who was nicknamed al-Khowarizmi, the man from Khowarizm. He was the author...
Analyti. "Mining the Meaningful Term Conjunctions from Materialised Faceted Taxonomies: Algorithms and Complexity". Knowledge and Information Systems Journal, 9(4), May 2006.Yannis Tzitzikas , Anastasia Analyti, Mining the meaningful term conjunctions from materialised faceted taxonomies: algorithms and ...
CIAC: International Conference on Algorithms and Complexity Conference proceedings info: CIAC 2013. 29k Accesses 4 Altmetric This is a preview of subscription content, log in via an institution to check access. About this book This book constitutes the refereed conference proceedings of the 8th ...
Algorithms and complexity for functions on general domains Erich Novak Article 101458 View PDF select article Tractability properties of the discrepancy in Orlicz norms Research articleOpen archive Tractability properties of the discrepancy in Orlicz norms ...
This book constitutes the refereed proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000, held in Rome, Italy, in March 2000.The 21 revised full papers presented were carefully reviewed and selected from 41 submissions; also included are four invited survey papers. Among...
Select CHAPTER 14 - The Complexity of Finite Functions Book chapterAbstract only CHAPTER 14-The Complexity of Finite Functions Ravi B. BOPPANA and Michael SIPSER Pages 757-804 Purchase View chapter View abstract Select CHAPTER 15 - Communication Networks ...
The proposed algorithm runs in O(n 3 log log n) time, where n is the number of vertices of the given polygon.doi:10.1016/B978-0-12-386870-1.50010-1Tetsuo AsanoGodfried ToussaintDiscrete Algorithms and Complexity... T Asano,G Toussaint - 《Discrete Algorithms & Complexity》 被引量: 126发...