ข้ามไปที่เนือ้หา
Short encodings of evolving structures แสดงตัวอย่างรายการนี้
ปิดแสดงตัวอย่างรายการนี้
ตรวจสอบ...

Short encodings of evolving structures

ผู้แต่ง: Daniel D Sleator; Robert E Tarjan; William P Thurston
สำนักพิมพ์: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [1991]
ชุด: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
ครั้งที่พิมพ์/รูปแบบ:   Print book : ภาษาอังกฤษดูครั้งที่พิมพ์และรูปแบบ
ฐานข้อมูล:WorldCat
สรุป:
Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme
คะแนน:

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

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

 

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

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

รายละเอียด

ประเภทของเอกสาร: หนังสือ
ผู้แต่งทั้งหมด : ผู้แต่งร่วม Daniel D Sleator; Robert E Tarjan; William P Thurston
OCLC Number: 25683200
หมายเหตุ: "December 1991."
คำอธิบาย: 26 pages : illustrations ; 28 cm.
ชื่อชุด: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-91-206.
ความรับผิดชอบ: Daniel D.K. Sleator, Robert E. Tarjan, William P. Thurston.

บทคัดย่อ:

Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme has a number of diverse applications. It can be used in efficient enumeration of combinatorial objects or for compact representation of program and data structure transformations. It can also be used to derive lower bounds on lengths of derivations.

We show for example that [omega](n log n) applications of the associative and commutative laws are required in the worst case to transform an n-variable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](n log n) 'diagonal flips' are required in the worst case to transform one n-vertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(n log n) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(n log n) upper bound for diagonal flips."

รีวิว

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

แท็ก

เป็นคนแรก.

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

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

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

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

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


Primary Entity

<http://www.worldcat.org/oclc/25683200> # Short encodings of evolving structures
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "25683200" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/26003906#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
   schema:about <http://id.worldcat.org/fast/946582> ; # Graph grammars
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/98260131> ; # William P. Thurston
   schema:contributor <http://viaf.org/viaf/73933029> ; # Robert Endre Tarjan
   schema:creator <http://viaf.org/viaf/54241399> ; # Daniel Dominic Sleator
   schema:datePublished "1991" ;
   schema:description "We show for example that [omega](n log n) applications of the associative and commutative laws are required in the worst case to transform an n-variable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](n log n) 'diagonal flips' are required in the worst case to transform one n-vertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(n log n) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(n log n) upper bound for diagonal flips.""@en ;
   schema:description "Abstract: "A derivation in a transformational system such as a graph grammar may be redundant in the sense that the exact order of the transformations may not affect the final outcome; all that matters is that each transformation, when applied, is applied to the correct substructure. By taking advantage of this redundancy, we are able to develop an efficient encoding scheme for such derivations. This encoding scheme has a number of diverse applications. It can be used in efficient enumeration of combinatorial objects or for compact representation of program and data structure transformations. It can also be used to derive lower bounds on lengths of derivations."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/26003906> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/26003906#Series/research_paper_carnegie_mellon_university_school_of_computer_science> ; # Research paper (Carnegie Mellon University. School of Computer Science) ;
   schema:name "Short encodings of evolving structures"@en ;
   schema:productID "25683200" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/25683200#PublicationEvent/pittsburgh_pa_school_of_computer_science_carnegie_mellon_university_1991> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/26003906#Agent/school_of_computer_science_carnegie_mellon_university> ; # School of Computer Science, Carnegie Mellon University
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/25683200> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/26003906#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/26003906#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
   schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/26003906#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/25683200> ; # Short encodings of evolving structures
   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/946582> # Graph grammars
    a schema:Intangible ;
   schema:name "Graph grammars"@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" ;
    .

<http://viaf.org/viaf/73933029> # Robert Endre Tarjan
    a schema:Person ;
   schema:birthDate "1948" ;
   schema:familyName "Tarjan" ;
   schema:givenName "Robert Endre" ;
   schema:givenName "Robert E." ;
   schema:name "Robert Endre Tarjan" ;
    .

<http://viaf.org/viaf/98260131> # William P. Thurston
    a schema:Person ;
   schema:birthDate "1946" ;
   schema:deathDate "2012" ;
   schema:familyName "Thurston" ;
   schema:givenName "William P." ;
   schema:name "William P. Thurston" ;
    .


Content-negotiable representations

Close Window

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

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