aller au contenu
Optimal binary trees in online algorithms Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérification...

Optimal binary trees in online algorithms

Auteur : Daniel D Sleator; M Talupur
Éditeur : Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2002]
Collection : Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Édition/format :   Livre imprimé : English
Base de données :WorldCat
Résumé :
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."
Évaluation :

(pas encore évalué) 0 avec des critiques - Soyez le premier.

Sujets
Plus comme ceci

 

Trouver un exemplaire dans la bibliothèque

&AllPage.SpinnerRetrieving; Recherche de bibliothèques qui possèdent cet ouvrage...

Détails

Format : Book
Tous les auteurs / collaborateurs : Daniel D Sleator; M Talupur
Numéro OCLC : 52156499
Notes : "September 2002."
Description : 7 pages ; 28 cm.
Titre de collection : Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-02-148.
Responsabilité : D. Sleator and M. Talupur.

Résumé :

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."

Critiques

Critiques d’utilisateurs
Récupération des critiques de GoodReads...
Récuperation des critiques DOGObooks…

Étiquettes

Soyez le premier.
Confirmez cette demande

Vous avez peut-être déjà demandé cet ouvrage. Veuillez sélectionner OK si vous voulez poursuivre avec cette demande quand même.

Données liées


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

Fermer la fenêtre

Veuillez vous identifier dans WorldCat 

Dont have an account? You can easily créez un compte gratuit.