Conclusion and future work
Identifieur interne : 000666 ( Istex/Corpus ); précédent : 000665; suivant : 000667Conclusion and future work
Auteurs : Varol AkmanSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1987.
English descriptors
- Teeft :
- Akman, Algebraic, Algebraic geometry, Algebraic methods, Algorithm, April, Artificial intelligence, August, Boundary findpath, Collision detection, Computational, Computational geometry, Computer graphics, Computer science, Computer science dept, Computer science division, Convex, Convex polygonal obstacles, Convex polyhedron, Cornell university, Data structures, Distance paths, Efficient algorithm, Euclidean, Euclidean space, Execution time, Fachbereich angewandte mathematik, February, Findpath, Findpath problem, Free space, Future work, Generalized voronoi diagrams, Geometric modeling, Goal points, Hopcroft, Ieee, Ieee transactions, Information processing letters, International journal, Invariant distribution, July, June, Lecture notes, Many obstacles, Markov, Markov chain, Massachusetts institute, Mathematical sciences, Mcgill university, Metropolis procedure, Motion planning, October, Operations research dept, Optimal line visit, Papadimitriou, Piano problem, Planar, Planar subdivision, Polygonal, Polygonal barriers, Polygonal obstacles, Polyhedral, Polyhedral obstacles, Polyhedral spaces, Polyhedron, Polynomial equations, Preliminary version, Proc, Purdue university, Rensselaer polytechnic institute, Robot, Robotics, Robotics research, Salesman problem, Sharir, Shortest, Shortest path, Shortest paths, Siam, Siam conf, Siam journal, Siam review, Single nonconvex polyhedron, Slam journal, Sofa problem, Stanford, Stanford university, System sciences, Theoretical computer science, Transition matrix, Voronoi, Voronoi diagrams, West lafayette, Workspace complexity, York university.
Url:
DOI: 10.1007/3-540-17629-2_12
Links to Exploration step
ISTEX:3FCFF0A849FCBF2D36F143AA731CB45FD518166ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Conclusion and future work</title><author wicri:is="90%"><name sortKey="Akman, Varol" sort="Akman, Varol" uniqKey="Akman V" first="Varol" last="Akman">Varol Akman</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3FCFF0A849FCBF2D36F143AA731CB45FD518166A</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/3-540-17629-2_12</idno><idno type="url">https://api.istex.fr/document/3FCFF0A849FCBF2D36F143AA731CB45FD518166A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000666</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000666</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Conclusion and future work</title><author wicri:is="90%"><name sortKey="Akman, Varol" sort="Akman, Varol" uniqKey="Akman V" first="Varol" last="Akman">Varol Akman</name></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1987</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Akman</term><term>Algebraic</term><term>Algebraic geometry</term><term>Algebraic methods</term><term>Algorithm</term><term>April</term><term>Artificial intelligence</term><term>August</term><term>Boundary findpath</term><term>Collision detection</term><term>Computational</term><term>Computational geometry</term><term>Computer graphics</term><term>Computer science</term><term>Computer science dept</term><term>Computer science division</term><term>Convex</term><term>Convex polygonal obstacles</term><term>Convex polyhedron</term><term>Cornell university</term><term>Data structures</term><term>Distance paths</term><term>Efficient algorithm</term><term>Euclidean</term><term>Euclidean space</term><term>Execution time</term><term>Fachbereich angewandte mathematik</term><term>February</term><term>Findpath</term><term>Findpath problem</term><term>Free space</term><term>Future work</term><term>Generalized voronoi diagrams</term><term>Geometric modeling</term><term>Goal points</term><term>Hopcroft</term><term>Ieee</term><term>Ieee transactions</term><term>Information processing letters</term><term>International journal</term><term>Invariant distribution</term><term>July</term><term>June</term><term>Lecture notes</term><term>Many obstacles</term><term>Markov</term><term>Markov chain</term><term>Massachusetts institute</term><term>Mathematical sciences</term><term>Mcgill university</term><term>Metropolis procedure</term><term>Motion planning</term><term>October</term><term>Operations research dept</term><term>Optimal line visit</term><term>Papadimitriou</term><term>Piano problem</term><term>Planar</term><term>Planar subdivision</term><term>Polygonal</term><term>Polygonal barriers</term><term>Polygonal obstacles</term><term>Polyhedral</term><term>Polyhedral obstacles</term><term>Polyhedral spaces</term><term>Polyhedron</term><term>Polynomial equations</term><term>Preliminary version</term><term>Proc</term><term>Purdue university</term><term>Rensselaer polytechnic institute</term><term>Robot</term><term>Robotics</term><term>Robotics research</term><term>Salesman problem</term><term>Sharir</term><term>Shortest</term><term>Shortest path</term><term>Shortest paths</term><term>Siam</term><term>Siam conf</term><term>Siam journal</term><term>Siam review</term><term>Single nonconvex polyhedron</term><term>Slam journal</term><term>Sofa problem</term><term>Stanford</term><term>Stanford university</term><term>System sciences</term><term>Theoretical computer science</term><term>Transition matrix</term><term>Voronoi</term><term>Voronoi diagrams</term><term>West lafayette</term><term>Workspace complexity</term><term>York university</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>polyhedron</json:string><json:string>proc</json:string><json:string>shortest paths</json:string><json:string>algorithm</json:string><json:string>june</json:string><json:string>findpath</json:string><json:string>computer science</json:string><json:string>sharir</json:string><json:string>computational geometry</json:string><json:string>voronoi</json:string><json:string>siam</json:string><json:string>robotics</json:string><json:string>ieee</json:string><json:string>polygonal</json:string><json:string>akman</json:string><json:string>polyhedral</json:string><json:string>october</json:string><json:string>february</json:string><json:string>hopcroft</json:string><json:string>euclidean</json:string><json:string>august</json:string><json:string>april</json:string><json:string>july</json:string><json:string>siam journal</json:string><json:string>slam journal</json:string><json:string>papadimitriou</json:string><json:string>markov</json:string><json:string>voronoi diagrams</json:string><json:string>computational</json:string><json:string>ieee transactions</json:string><json:string>markov chain</json:string><json:string>algebraic</json:string><json:string>massachusetts institute</json:string><json:string>piano problem</json:string><json:string>computer science dept</json:string><json:string>shortest</json:string><json:string>robot</json:string><json:string>artificial intelligence</json:string><json:string>goal points</json:string><json:string>theoretical computer science</json:string><json:string>rensselaer polytechnic institute</json:string><json:string>international journal</json:string><json:string>stanford university</json:string><json:string>convex</json:string><json:string>stanford</json:string><json:string>shortest path</json:string><json:string>information processing letters</json:string><json:string>metropolis procedure</json:string><json:string>data structures</json:string><json:string>euclidean space</json:string><json:string>preliminary version</json:string><json:string>robotics research</json:string><json:string>salesman problem</json:string><json:string>invariant distribution</json:string><json:string>polygonal obstacles</json:string><json:string>operations research dept</json:string><json:string>polyhedral obstacles</json:string><json:string>transition matrix</json:string><json:string>findpath problem</json:string><json:string>planar</json:string><json:string>execution time</json:string><json:string>workspace complexity</json:string><json:string>collision detection</json:string><json:string>lecture notes</json:string><json:string>computer graphics</json:string><json:string>optimal line visit</json:string><json:string>boundary findpath</json:string><json:string>generalized voronoi diagrams</json:string><json:string>computer science division</json:string><json:string>mathematical sciences</json:string><json:string>york university</json:string><json:string>planar subdivision</json:string><json:string>siam conf</json:string><json:string>geometric modeling</json:string><json:string>siam review</json:string><json:string>mcgill university</json:string><json:string>cornell university</json:string><json:string>motion planning</json:string><json:string>convex polyhedron</json:string><json:string>polyhedral spaces</json:string><json:string>sofa problem</json:string><json:string>purdue university</json:string><json:string>system sciences</json:string><json:string>efficient algorithm</json:string><json:string>west lafayette</json:string><json:string>free space</json:string><json:string>distance paths</json:string><json:string>future work</json:string><json:string>algebraic geometry</json:string><json:string>single nonconvex polyhedron</json:string><json:string>polynomial equations</json:string><json:string>many obstacles</json:string><json:string>convex polygonal obstacles</json:string><json:string>fachbereich angewandte mathematik</json:string><json:string>algebraic methods</json:string><json:string>polygonal barriers</json:string></teeft></keywords><author><json:item><name>Varol Akman</name></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>ReviewPaper</json:string></originalGenre><qualityIndicators><score>5.012</score><pdfWordCount>5108</pdfWordCount><pdfCharCount>32515</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>19</pdfPageCount><pdfPageSize>468 x 684 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>1</abstractWordCount><abstractCharCount>0</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Conclusion and future work</title><chapterId><json:string>6</json:string><json:string>Chap6</json:string></chapterId><genre><json:string>review-article</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1987</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>G. Goos</name></json:item><json:item><name>J. Hartmanis</name></json:item><json:item><name>D. Barstow</name></json:item><json:item><name>W. Brauer</name></json:item><json:item><name>P. Brinch Hansen</name></json:item><json:item><name>D. Gries</name></json:item><json:item><name>D. Luckham</name></json:item><json:item><name>C. Moler</name></json:item><json:item><name>A. Pnueli</name></json:item><json:item><name>G. Seegmüller</name></json:item><json:item><name>J. Stoer</name></json:item><json:item><name>N. Wirth</name></json:item></editor></serie><host><title>Unobstructed Shortest Paths in Polyhedral Environments</title><language><json:string>unknown</json:string></language><copyrightDate>1987</copyrightDate><doi><json:string>10.1007/3-540-17629-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-47731-0</json:string></eisbn><bookId><json:string>3540176292</json:string></bookId><isbn><json:string>978-3-540-17629-9</json:string></isbn><volume>251</volume><pages><first>85</first><last>103</last></pages><genre><json:string>book-series</json:string></genre><author><json:item><name>Varol Akman</name></json:item></author><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Computer Graphics</value></json:item><json:item><value>Simulation and Modeling</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item></subject></host><publicationDate>2005</publicationDate><copyrightDate>1987</copyrightDate><doi><json:string>10.1007/3-540-17629-2_12</json:string></doi><id>3FCFF0A849FCBF2D36F143AA731CB45FD518166A</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/3FCFF0A849FCBF2D36F143AA731CB45FD518166A/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/3FCFF0A849FCBF2D36F143AA731CB45FD518166A/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/3FCFF0A849FCBF2D36F143AA731CB45FD518166A/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Conclusion and future work</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag, 1987</p></availability><date>1987</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Conclusion and future work</title><author xml:id="author-0000"><persName><forename type="first">Varol</forename><surname>Akman</surname></persName></author><idno type="istex">3FCFF0A849FCBF2D36F143AA731CB45FD518166A</idno><idno type="DOI">10.1007/3-540-17629-2_12</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></analytic><monogr><title level="m">Unobstructed Shortest Paths in Polyhedral Environments</title><idno type="DOI">10.1007/3-540-17629-2</idno><idno type="pISBN">978-3-540-17629-9</idno><idno type="eISBN">978-3-540-47731-0</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-ID">20425</idno><idno type="book-ID">3540176292</idno><idno type="book-chapter-count">6</idno><idno type="book-volume-number">251</idno><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005-06-01"></date><biblScope unit="volume">251</biblScope><biblScope unit="chap">6</biblScope><biblScope unit="page" from="85">85</biblScope><biblScope unit="page" to="103">103</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor xml:id="serie-author-0000"><persName><forename type="first">G.</forename><surname>Goos</surname></persName></editor><editor xml:id="serie-author-0001"><persName><forename type="first">J.</forename><surname>Hartmanis</surname></persName></editor><editor xml:id="serie-author-0002"><persName><forename type="first">D.</forename><surname>Barstow</surname></persName></editor><editor xml:id="serie-author-0003"><persName><forename type="first">W.</forename><surname>Brauer</surname></persName></editor><editor xml:id="serie-author-0004"><persName><forename type="first">P.</forename><surname>Brinch Hansen</surname></persName></editor><editor xml:id="serie-author-0005"><persName><forename type="first">D.</forename><surname>Gries</surname></persName></editor><editor xml:id="serie-author-0006"><persName><forename type="first">D.</forename><surname>Luckham</surname></persName></editor><editor xml:id="serie-author-0007"><persName><forename type="first">C.</forename><surname>Moler</surname></persName></editor><editor xml:id="serie-author-0008"><persName><forename type="first">A.</forename><surname>Pnueli</surname></persName></editor><editor xml:id="serie-author-0009"><persName><forename type="first">G.</forename><surname>Seegmüller</surname></persName></editor><editor xml:id="serie-author-0010"><persName><forename type="first">J.</forename><surname>Stoer</surname></persName></editor><editor xml:id="serie-author-0011"><persName><forename type="first">N.</forename><surname>Wirth</surname></persName></editor><biblScope><date>1987</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1987</date></creation><langUsage><language ident="en">en</language></langUsage><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><item><term>Computer Science</term></item><label>I22013</label><item><term>Computer Graphics</term></item><label>I21025</label><item><term>Simulation and Modeling</term></item><label>I21017</label><item><term>Artificial Intelligence (incl. Robotics)</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005-06-01">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/3FCFF0A849FCBF2D36F143AA731CB45FD518166A/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle><SeriesAbbreviatedTitle>Lect Notes Comput Sci</SeriesAbbreviatedTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Barstow</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>W.</GivenName><FamilyName>Brauer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>P.</GivenName><FamilyName>Brinch Hansen</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Gries</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Luckham</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Moler</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>A.</GivenName><FamilyName>Pnueli</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>G.</GivenName><FamilyName>Seegmüller</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>J.</GivenName><FamilyName>Stoer</FamilyName></EditorName></Editor><Editor><EditorName DisplayOrder="Western"><GivenName>N.</GivenName><FamilyName>Wirth</FamilyName></EditorName></Editor></EditorGroup></SeriesHeader><Book Language="En"><BookInfo MediaType="eBook" Language="En" BookProductType="Monograph" TocLevels="0" NumberingStyle="ChapterContent"><BookID>3540176292</BookID><BookTitle>Unobstructed Shortest Paths in Polyhedral Environments</BookTitle><BookVolumeNumber>251</BookVolumeNumber><BookDOI>10.1007/3-540-17629-2</BookDOI><BookTitleID>20425</BookTitleID><BookPrintISBN>978-3-540-17629-9</BookPrintISBN><BookElectronicISBN>978-3-540-47731-0</BookElectronicISBN><BookChapterCount>6</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1987</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I22013" Priority="1" Type="Secondary">Computer Graphics</BookSubject><BookSubject Code="I21025" Priority="2" Type="Secondary">Simulation and Modeling</BookSubject><BookSubject Code="I21017" Priority="3" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup></BookInfo><BookHeader><AuthorGroup><Author><AuthorName DisplayOrder="Western"><GivenName>Varol</GivenName><FamilyName>Akman</FamilyName></AuthorName></Author></AuthorGroup></BookHeader><Chapter ID="Chap6" Language="En"><ChapterInfo ChapterType="ReviewPaper" NumberingStyle="ChapterContent" TocLevels="0" ContainsESM="No"><ChapterID>6</ChapterID><ChapterNumber>6</ChapterNumber><ChapterDOI>10.1007/3-540-17629-2_12</ChapterDOI><ChapterSequenceNumber>6</ChapterSequenceNumber><ChapterTitle Language="En">Conclusion and future work</ChapterTitle><ChapterFirstPage>85</ChapterFirstPage><ChapterLastPage>103</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1987</CopyrightYear></ChapterCopyright><ChapterHistory><OnlineDate><Year>2005</Year><Month>6</Month><Day>1</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>3540176292</BookID><BookTitle>Unobstructed Shortest Paths in Polyhedral Environments</BookTitle></ChapterContext></ChapterInfo><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Conclusion and future work</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Conclusion and future work</title></titleInfo><name type="personal"><namePart type="given">Varol</namePart><namePart type="family">Akman</namePart></name><typeOfResource>text</typeOfResource><genre type="review-article" displayLabel="ReviewPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005-06-01</dateIssued><copyrightDate encoding="w3cdtf">1987</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><relatedItem type="host"><titleInfo><title>Unobstructed Shortest Paths in Polyhedral Environments</title></titleInfo><name type="personal"><namePart type="given">Varol</namePart><namePart type="family">Akman</namePart></name><genre type="book-series" displayLabel="Monograph"></genre><originInfo><copyrightDate encoding="w3cdtf">1987</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic><topic authority="SpringerSubjectCodes" authorityURI="I21025">Simulation and Modeling</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic></subject><identifier type="DOI">10.1007/3-540-17629-2</identifier><identifier type="ISBN">978-3-540-17629-9</identifier><identifier type="eISBN">978-3-540-47731-0</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">20425</identifier><identifier type="BookID">3540176292</identifier><identifier type="BookChapterCount">6</identifier><identifier type="BookVolumeNumber">251</identifier><part><date>1987</date><detail type="volume"><number>251</number><caption>vol.</caption></detail><detail type="chapter"><number>6</number></detail><extent unit="pages"><start>85</start><end>103</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1987</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Goos</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Hartmanis</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Barstow</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">W.</namePart><namePart type="family">Brauer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">P.</namePart><namePart type="family">Brinch Hansen</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Gries</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Luckham</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Moler</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Pnueli</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">G.</namePart><namePart type="family">Seegmüller</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">Stoer</namePart><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="family">Wirth</namePart><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">1987</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><part><detail type="chapter"><number>6</number></detail></part><recordInfo><recordOrigin>Springer-Verlag, 1987</recordOrigin></recordInfo></relatedItem><identifier type="istex">3FCFF0A849FCBF2D36F143AA731CB45FD518166A</identifier><identifier type="DOI">10.1007/3-540-17629-2_12</identifier><identifier type="ChapterID">6</identifier><identifier type="ChapterID">Chap6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1987</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1987</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000666 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000666 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:3FCFF0A849FCBF2D36F143AA731CB45FD518166A
|texte= Conclusion and future work
}}
| This area was generated with Dilib version V0.6.33. |  |