passa ai contenuti
An efficient algorithm for determining the length of the longest dead path in an Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

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

Autore: Stefano Pallottino; Tommaso Toffoli
Editore: Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1980.
Serie: Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science), MIT:LCS/TM-149.
Edizione/Formato:   book_printbook : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo documento: Book
Tutti gli autori / Collaboratori: Stefano Pallottino; Tommaso Toffoli
Numero OCLC: 223789587
Note: Cover title.
Descrizione: 9 pages : illustrations ; 28 cm.
Titolo della serie: Technical report (Massachusetts Institute of Technology. Laboratory for Computer Science), MIT:LCS/TM-149.
Responsabilità: Stefano Pallottino, Tommaso Toffoli.

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.

Documenti simili

Soggetti correlati:(1)

Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


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

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.