跳到内容
An efficient algorithm for determining the length of the longest dead path in a 预览资料
关闭预览资料
正在查...

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

著者: Stefano Pallottino; Tommaso Toffoli
出版商: Cambridge : Massachusetts Institute of Technology, Laboratory for Computer Science, 1980.
丛书: Massachusetts Institute of Technology.; Laboratory for Computer Science.; Technical memoranda
版本/格式:   Print book : 英语查看所有的版本和格式
数据库:WorldCat
评估:

(尚未评估) 0 附有评论 - 争取成为第一个。

主题
更多类似这样的

 

在图书馆查找

&AllPage.SpinnerRetrieving; 正在查找有这资料的图书馆...

详细书目

文件类型:
所有的著者/提供者: Stefano Pallottino; Tommaso Toffoli
OCLC号码: 6312150
注意: This research was supported in part by Grant N00014-75-C-0661, Office of Naval Research, funded by DARPA, and in part by the Consiglio Nazionale delle Ricerche, Roma, Italy.
描述: 9 pages ; 28 cm.
丛书名: Massachusetts Institute of Technology.; Laboratory for Computer Science.; Technical memoranda
责任: Stefano Pallottino, Tommaso Toffoli.

评论

用户提供的评论
正在获取GoodReads评论...
正在检索DOGObooks的评论

标签

争取是第一个!

相似资料

相关主题:(1)

确认申请

你可能已经申请过这份资料。如果还是想申请,请选确认。

链接数据


<http://www.worldcat.org/oclc/6312150>
library:oclcnum"6312150"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:contributor
schema:creator
schema:datePublished"1980"
schema:exampleOfWork<http://worldcat.org/entity/work/id/137161805>
schema:inLanguage"en"
schema:isPartOf
schema:name"An efficient algorithm for determining the length of the longest dead path in a "LIFO" branch-and-bound exploration schema"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

关闭窗口

请登入WorldCat 

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