跳至内容
An efficient algorithm for determining the length of the longest dead path in an 線上預覽
關閉線上預覽
正在查...

An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema

作者: Stefano Pallottino; Tommaso Toffoli
出版商: Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1980.
叢書: Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science), MIT:LCS/TM-149.
版本/格式:   Print book : 英語所有版本和格式的總覽
資料庫:WorldCat
評定級別:

(尚未評分) 0 附有評論 - 成爲第一個。

主題
更多類似這樣的

 

在圖書館查詢

&AllPage.SpinnerRetrieving; 正在查詢有此資料的圖書館...

詳細書目

文件類型: 圖書
所有的作者/貢獻者: Stefano Pallottino; Tommaso Toffoli
OCLC系統控制編碼: 223789587
注意: Cover title.
描述: 9 pages : illustrations ; 28 cm.
叢書名: Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science), MIT:LCS/TM-149.
責任: Stefano Pallottino, Tommaso Toffoli.

評論

讀者提供的評論
正在擷取GoodReads評論...
正在擷取DOGObooks的評論

標籤

成爲第一個

類似資料

相關主題:(1)

確認申請

你可能已經申請過這份資料。若還是想申請,請選確認。

連結資料


Primary Entity

<http://www.worldcat.org/oclc/223789587> # An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "223789587" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/137161805#Place/cambridge_mass> ; # Cambridge, Mass.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://id.worldcat.org/fast/805020> ; # Algorithms
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/137161805#Person/toffoli_tommaso> ; # Tommaso Toffoli
   schema:creator <http://viaf.org/viaf/104357341> ; # Stefano Pallottino
   schema:datePublished "1980" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/137161805> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/137161805#Series/technical_report_massachusetts_institute_of_technology_laboratory_for_computer_science> ; # Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science) ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/137161805#Series/massachusetts_institute_of_technology_laboratory_for_computer_science_technical_report> ; # Massachusetts Institute of Technology. Laboratory for Computer Science. Technical Report ;
   schema:name "An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema"@en ;
   schema:productID "223789587" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/223789587#PublicationEvent/cambridge_mass_laboratory_for_computer_science_massachusetts_institute_of_technology_1980> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/137161805#Agent/laboratory_for_computer_science_massachusetts_institute_of_technology> ; # Laboratory for Computer Science, Massachusetts Institute of Technology
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/223789587> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/137161805#Agent/laboratory_for_computer_science_massachusetts_institute_of_technology> # Laboratory for Computer Science, Massachusetts Institute of Technology
    a bgn:Agent ;
   schema:name "Laboratory for Computer Science, Massachusetts Institute of Technology" ;
    .

<http://experiment.worldcat.org/entity/work/data/137161805#Person/toffoli_tommaso> # Tommaso Toffoli
    a schema:Person ;
   schema:familyName "Toffoli" ;
   schema:givenName "Tommaso" ;
   schema:name "Tommaso Toffoli" ;
    .

<http://experiment.worldcat.org/entity/work/data/137161805#Place/cambridge_mass> # Cambridge, Mass.
    a schema:Place ;
   schema:name "Cambridge, Mass." ;
    .

<http://experiment.worldcat.org/entity/work/data/137161805#Series/massachusetts_institute_of_technology_laboratory_for_computer_science_technical_report> # Massachusetts Institute of Technology. Laboratory for Computer Science. Technical Report ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/223789587> ; # An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema
   schema:name "Massachusetts Institute of Technology. Laboratory for Computer Science. Technical Report ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/137161805#Series/technical_report_massachusetts_institute_of_technology_laboratory_for_computer_science> # Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science) ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/223789587> ; # An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema
   schema:name "Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science) ;" ;
    .

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

<http://viaf.org/viaf/104357341> # Stefano Pallottino
    a schema:Person ;
   schema:familyName "Pallottino" ;
   schema:givenName "Stefano" ;
   schema:name "Stefano Pallottino" ;
    .

<http://www.worldcat.org/title/-/oclc/223789587>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/223789587> ; # An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema
   schema:dateModified "2016-05-12" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

關閉視窗

請登入WorldCat 

没有帳號嗎?你可很容易的 建立免費的帳號.