A minimum cost path search algorithm through tile obstacles.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/ispd/XingK01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/ispd/XingK01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Russell_Kao
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Zhaoyun_Xing
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F369691.369771
>
foaf:
homepage
<
https://doi.org/10.1145/369691.369771
>
dc:
identifier
DBLP conf/ispd/XingK01
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F369691.369771
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
rdfs:
label
A minimum cost path search algorithm through tile obstacles.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Russell_Kao
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Zhaoyun_Xing
>
swrc:
pages
192-197
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/ispd/2001
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/ispd/XingK01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/ispd/XingK01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/ispd/ispd2001.html#XingK01
>
rdfs:
seeAlso
<
https://doi.org/10.1145/369691.369771
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/ispd
>
dc:
subject
VLSI routing, shortest path search
(xsd:string)
dc:
title
A minimum cost path search algorithm through tile obstacles.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document