跳到内容
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.
版本/格式:   打印图书 : 英语查看所有的版本和格式
数据库: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 "2017-07-08" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

关闭窗口

请登入WorldCat 

没有张号吗?很容易就可以 建立免费的账号.