doorgaan naar inhoud
An efficient algorithm for determining the length of the longest dead path in a Voorbeeldweergave van dit item
SluitenVoorbeeldweergave van dit item
Bezig met controle...

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

Auteur: Stefano Pallottino; Tommaso Toffoli
Uitgever: Cambridge : Massachusetts Institute of Technology, Laboratory for Computer Science, 1980.
Serie: Massachusetts Institute of Technology.; Laboratory for Computer Science.; Technical memoranda
Editie/Formaat:   Print book : EngelsAlle edities en materiaalsoorten bekijken.
Database:WorldCat
Beoordeling:

(nog niet beoordeeld) 0 met beoordelingen - U bent de eerste

Onderwerpen
Meer in deze trant

 

Zoeken naar een in de bibliotheek beschikbaar exemplaar

&AllPage.SpinnerRetrieving; Bibliotheken met dit item worden gezocht…

Details

Soort document: Boek
Alle auteurs / medewerkers: Stefano Pallottino; Tommaso Toffoli
OCLC-nummer: 6312150
Opmerkingen: 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.
Beschrijving: 9 pages ; 28 cm.
Serietitel: Massachusetts Institute of Technology.; Laboratory for Computer Science.; Technical memoranda
Verantwoordelijkheid: Stefano Pallottino, Tommaso Toffoli.

Beoordelingen

Beoordelingen door gebruikers
Beoordelingen van GoodReads worden opgehaald...
Bezig met opvragen DOGObooks-reviews...

Tags

U bent de eerste.

Vergelijkbare items

Verwante onderwerpen:(1)

Bevestig deze aanvraag

Misschien heeft u dit item reeds aangevraagd. Selecteer a.u.b. Ok als u toch wilt doorgaan met deze aanvraag.

Gekoppelde data


Primary Entity

<http://www.worldcat.org/oclc/6312150> # An efficient algorithm for determining the length of the longest dead path in a "LIFO" branch-and-bound exploration schema
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "6312150" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/137161805#Place/cambridge> ; # Cambridge
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://id.worldcat.org/fast/837828> ; # Branch and bound 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/mit_lcs_tm_149> ; # MIT/LCS/TM-149
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/137161805#Series/technical_memoranda> ; # Technical memoranda ;
   schema:name "An efficient algorithm for determining the length of the longest dead path in a "LIFO" branch-and-bound exploration schema"@en ;
   schema:productID "6312150" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/6312150#PublicationEvent/cambridge_massachusetts_institute_of_technology_laboratory_for_computer_science_1980> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/137161805#Agent/massachusetts_institute_of_technology_laboratory_for_computer_science> ; # Massachusetts Institute of Technology, Laboratory for Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/6312150> ;
    .


Related Entities

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

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

<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#Series/mit_lcs_tm_149> # MIT/LCS/TM-149
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/6312150> ; # An efficient algorithm for determining the length of the longest dead path in a "LIFO" branch-and-bound exploration schema
   schema:name "MIT/LCS/TM-149" ;
    .

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

<http://id.worldcat.org/fast/837828> # Branch and bound algorithms
    a schema:Intangible ;
   schema:name "Branch and bound 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/6312150>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/6312150> ; # An efficient algorithm for determining the length of the longest dead path in a "LIFO" branch-and-bound exploration schema
   schema:dateModified "2017-04-01" ;
   void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Venster sluiten

Meld u aan bij WorldCat 

Heeft u geen account? U kunt eenvoudig een nieuwe gratis account aanmaken.