pular para conteúdo
An efficient algorithm for determining the length of the longest dead path in an Ver prévia deste item
FecharVer prévia deste item
Checando...

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

Autor: Stefano Pallottino; Tommaso Toffoli
Editora: Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1980.
Séries: Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science), MIT:LCS/TM-149.
Edição/Formato   Print book : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Stefano Pallottino; Tommaso Toffoli
Número OCLC: 223789587
Notas: Cover title.
Descrição: 9 pages : illustrations ; 28 cm.
Título da Série: Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science), MIT:LCS/TM-149.
Responsabilidade: Stefano Pallottino, Tommaso Toffoli.

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.

Ítens Similares

Assuntos Relacionados:(1)

Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


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://viaf.org/viaf/162298289> ; # 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#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://viaf.org/viaf/162298289> # Tommaso Toffoli
    a schema:Person ;
    schema:familyName "Toffoli" ;
    schema:givenName "Tommaso" ;
    schema:name "Tommaso Toffoli" ;
    .

<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 "2015-07-21" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.