zum Inhalt wechseln
Optimal binary trees in online algorithms Titelvorschau
SchließenTitelvorschau
Prüfung…

Optimal binary trees in online algorithms

Verfasser/in: Daniel D Sleator; M Talupur
Verlag: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Serien: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Ausgabe/Format   Print book : Englisch
Datenbank:WorldCat
Zusammenfassung:
Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm."
Bewertung:

(noch nicht bewertet) 0 mit Rezensionen - Verfassen Sie als Erste eine Rezension.

Themen
Ähnliche Titel

 

Exemplar ausleihen

&AllPage.SpinnerRetrieving; Suche nach Bibliotheken, die diesen Titel besitzen ...

Details

Dokumenttyp: Buch
Alle Autoren: Daniel D Sleator; M Talupur
OCLC-Nummer: 52156499
Anmerkungen: "September 2002."
Beschreibung: 7 pages ; 28 cm.
Serientitel: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Verfasserangabe: D. Sleator and M. Talupur.

Abstract:

Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm."

Rezensionen

Nutzer-Rezensionen
Suche nach GoodReads-Rezensionen
Suche nach DOGObooks-Rezensionen…

Tags

Tragen Sie als Erste Tags ein.
Anfrage bestätigen

Sie haben diesen Titel bereits angefordert. Wenn Sie trotzdem fortfahren möchten, klicken Sie auf OK.

Verlinkung


Primary Entity

<http://www.worldcat.org/oclc/52156499> # Optimal binary trees in online algorithms
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "52156499" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/9136071#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
   schema:about <http://id.worldcat.org/fast/1045924> ; # Online algorithms
   schema:about <http://dewey.info/class/510.7808/> ;
   schema:about <http://id.worldcat.org/fast/831860> ; # Binary control systems
   schema:about <http://id.worldcat.org/fast/887978> ; # Data structures (Computer science)
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/9136071#Person/talupur_m> ; # M. Talupur
   schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   schema:datePublished "2002" ;
   schema:description "Abstract: "Some binary search tree algorithms, such as splay trees, structure the tree in a way that depends on the history of accesses. In this paper we consider what happens if at each point in time the optimal binary search tree (for the access frequencies seen so far) is maintained. We prove lower and upper bounds on the competitive ratio (with respect to the final optimal tree) of such an algorithm.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/9136071> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/9136071#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
   schema:name "Optimal binary trees in online algorithms"@en ;
   schema:productID "52156499" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/52156499#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_2002> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/9136071#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/52156499> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/9136071#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/9136071#Person/talupur_m> # M. Talupur
    a schema:Person ;
   schema:familyName "Talupur" ;
   schema:givenName "M." ;
   schema:name "M. Talupur" ;
    .

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

<http://experiment.worldcat.org/entity/work/data/9136071#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/52156499> ; # Optimal binary trees in online algorithms
   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/1045924> # Online algorithms
    a schema:Intangible ;
   schema:name "Online algorithms"@en ;
    .

<http://id.worldcat.org/fast/831860> # Binary control systems
    a schema:Intangible ;
   schema:name "Binary control systems"@en ;
    .

<http://id.worldcat.org/fast/887978> # Data structures (Computer science)
    a schema:Intangible ;
   schema:name "Data structures (Computer science)"@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

Fenster schließen

Bitte in WorldCat einloggen 

Sie haben kein Konto? Sie können sehr einfach ein kostenloses Konto anlegen,.