Approximate algorithms for time separation of events.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/iccad/ChakrabortyD97
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/iccad/ChakrabortyD97
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_L._Dill
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Supratik_Chakraborty
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FICCAD.1997.643520
>
foaf:
homepage
<
https://doi.org/10.1109/ICCAD.1997.643520
>
dc:
identifier
DBLP conf/iccad/ChakrabortyD97
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FICCAD.1997.643520
(xsd:string)
dcterms:
issued
1997
(xsd:gYear)
rdfs:
label
Approximate algorithms for time separation of events.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_L._Dill
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Supratik_Chakraborty
>
swrc:
pages
190-194
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/iccad/1997
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/iccad/ChakrabortyD97/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/iccad/ChakrabortyD97
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/iccad/iccad1997.html#ChakrabortyD97
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ICCAD.1997.643520
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/iccad
>
dc:
subject
Time separation of events, timing constraint graph, min/max constraints, polynomial-time algorithm, conservative approximation, non-convex feasible space, convex approximation.
(xsd:string)
dc:
title
Approximate algorithms for time separation of events.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document