ข้ามไปที่เนือ้หา
Dynamic optimality and multi-splay trees แสดงตัวอย่างรายการนี้
ปิดแสดงตัวอย่างรายการนี้
ตรวจสอบ...

Dynamic optimality and multi-splay trees

ผู้แต่ง: Daniel D Sleator; Chengwen Chris Wang
สำนักพิมพ์: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2004]
ชุด: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
ครั้งที่พิมพ์/รูปแบบ:   Print book : ภาษาอังกฤษ
ฐานข้อมูล:WorldCat
สรุป:
Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST  อ่านมากขึ้น…
คะแนน:

(ยังไม่ให้คะแนน) 0 กับความคิดเห็น - เป็นคนแรก

หัวเรื่อง
เพิ่มเติมเช่นนี้

 

ค้นหาสำเนาออนไลน์

เชื่อมโยงไปยังรายการนี้

ค้นหาสำเนาในห้องสมุด

&AllPage.SpinnerRetrieving; ค้นหาห้องสมุดที่มีรายการนี้

รายละเอียด

ขนิดวัสดุ: ทรัพยากรอินแทอร์เน็ต
ประเภทของเอกสาร: หนังสือ, แหล่งข้อมูลอินเทอร์เน็ต
ผู้แต่งทั้งหมด : ผู้แต่งร่วม Daniel D Sleator; Chengwen Chris Wang
OCLC Number: 57217789
หมายเหตุ: "November 5, 2004."
คำอธิบาย: 12 pages : illustrations ; 28 cm.
ชื่อชุด: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-04-171.
ความรับผิดชอบ: Daniel Dominic Sleator and Chengwen Chris Wang.

บทคัดย่อ:

Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST algorithm which is nearly dynamically optimal -- its competitive ratio is O(log log n) instead of a constant. Unfortunately, for many access patterns, tango is worse than other BST algorithms by a factor of log log n. In this paper we introduce multi-splay trees, which can be viewed as a variant of splay trees. We prove the multi-splay access lemma, which resembles the access lemma for splay trees. With different assignment of weights, this lemma allows us to prove various bounds on the performance of multi-splay trees. Specifically, we prove that multi-splay trees are O(log log n)-competitive, and amortized O(log n). This is the first BST data structure to simultaneously achieve these two bounds. In addition, the algorithm is simple enough that we include code for its key parts."

รีวิว

ความคิดเห็นผู้ที่ใช้งาน
กำลังค้นคืน รีวิว GoodReads…
ค้นคืน DOGObooks บทวิจารณ์

แท็ก

เป็นคนแรก.

รายการคล้ายกัน

หัวเรื่องที่เกี่ยวข้อง:(3)

ยืนยันคำขอนี้

คุณอาจะร้องขอรายการนี้แล้. โปรดเลือก ตกลง ถ้าคุณต้องการดำเนินการคำขอนี้ต่อไป.

เชิ่อมโยงข้อมูล


Primary Entity

<http://www.worldcat.org/oclc/57217789> # Dynamic optimality and multi-splay trees
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "57217789" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/17589306#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
   schema:about <http://dewey.info/class/510.7808/> ;
   schema:about <http://id.worldcat.org/fast/868980> ; # Combinatorial optimization
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:about <http://id.worldcat.org/fast/1156136> ; # Trees (Graph theory)
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/17589306#Person/wang_chengwen_chris> ; # Chengwen Chris Wang
   schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   schema:datePublished "2004" ;
   schema:description "Abstract: "The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tango, a BST algorithm which is nearly dynamically optimal -- its competitive ratio is O(log log n) instead of a constant. Unfortunately, for many access patterns, tango is worse than other BST algorithms by a factor of log log n. In this paper we introduce multi-splay trees, which can be viewed as a variant of splay trees. We prove the multi-splay access lemma, which resembles the access lemma for splay trees. With different assignment of weights, this lemma allows us to prove various bounds on the performance of multi-splay trees. Specifically, we prove that multi-splay trees are O(log log n)-competitive, and amortized O(log n). This is the first BST data structure to simultaneously achieve these two bounds. In addition, the algorithm is simple enough that we include code for its key parts.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/17589306> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/17589306#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
   schema:name "Dynamic optimality and multi-splay trees"@en ;
   schema:productID "57217789" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/57217789#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_2004> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/17589306#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
   schema:url <http://doi.library.cmu.edu/10.1184/OCLC/57217789> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/57217789> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/17589306#Agent/school_of_computer_science_carnegie_mellon_university> # School of Computer Science, Carnegie Mellon University
    a bgn:Agent ;
   schema:name "School of Computer Science, Carnegie Mellon University" ;
    .

<http://experiment.worldcat.org/entity/work/data/17589306#Person/wang_chengwen_chris> # Chengwen Chris Wang
    a schema:Person ;
   schema:familyName "Wang" ;
   schema:givenName "Chengwen Chris" ;
   schema:name "Chengwen Chris Wang" ;
    .

<http://experiment.worldcat.org/entity/work/data/17589306#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
   schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/17589306#Series/research_paper_carnegie_mellon_university_school_of_computer_science> # Research paper (Carnegie Mellon University. School of Computer Science) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/57217789> ; # Dynamic optimality and multi-splay trees
   schema:name "Research paper (Carnegie Mellon University. School of Computer Science) ;" ;
   schema:name "[Research paper] / Carnegie Mellon University. School of Computer Science ;" ;
    .

<http://id.worldcat.org/fast/1156136> # Trees (Graph theory)
    a schema:Intangible ;
   schema:name "Trees (Graph theory)"@en ;
    .

<http://id.worldcat.org/fast/805020> # Algorithms
    a schema:Intangible ;
   schema:name "Algorithms"@en ;
    .

<http://id.worldcat.org/fast/868980> # Combinatorial optimization
    a schema:Intangible ;
   schema:name "Combinatorial optimization"@en ;
    .

<http://viaf.org/viaf/54241399> # Daniel Dominic Sleator
    a schema:Person ;
   schema:birthDate "1953" ;
   schema:familyName "Sleator" ;
   schema:givenName "Daniel Dominic" ;
   schema:givenName "Daniel D." ;
   schema:name "Daniel Dominic Sleator" ;
    .


Content-negotiable representations

Close Window

กรุณาลงชื่อเข้าสู่ระบบ WorldCat 

ยังไม่มีบัญชีผู้ใช้? คุณสามารถสร้างได้อย่างง่ายดาย สร้างบัญชีผู้ใช้ฟรี.