Algorithms and heuristics in VLSI design
Identifieur interne : 000B26 ( PascalFrancis/Checkpoint ); précédent : 000B25; suivant : 000B27Algorithms and heuristics in VLSI design
Auteurs : Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 2002.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:03-0184306Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Algorithms and heuristics in VLSI design</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>University of Trier, Department of Computer Science</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Department of Computer Science</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>University of Trier, Department of Computer Science</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Department of Computer Science</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">03-0184306</idno><date when="2002">2002</date><idno type="stanalyst">PASCAL 03-0184306 INIST</idno><idno type="RBID">Pascal:03-0184306</idno><idno type="wicri:Area/PascalFrancis/Corpus">000C74</idno><idno type="wicri:Area/PascalFrancis/Curation">000241</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000B26</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000B26</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Algorithms and heuristics in VLSI design</title><author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>University of Trier, Department of Computer Science</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Department of Computer Science</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName><orgName type="university">Université de Trèves</orgName></affiliation></author><author><name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name><affiliation wicri:level="4"><inist:fA14 i1="01"><s1>University of Trier, Department of Computer Science</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Department of Computer Science</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="2002">2002</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Binary decision diagram</term><term>Circuit design</term><term>Formal verification</term><term>Heuristic method</term><term>Reachability analysis</term><term>VLSI circuit</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Conception circuit</term><term>Circuit VLSI</term><term>Méthode heuristique</term><term>Vérification formelle</term><term>Diagramme binaire décision</term><term>Analyse atteignabilité</term></keywords></textClass></profileDesc></teiHeader></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>2547</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>Algorithms and heuristics in VLSI design</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>Experimental algorithmics : from algorithm design to robust and efficient software : Dagstuhl, September 2000</s1></fA09><fA11 i1="01" i2="1"><s1>MEINEL (Christoph)</s1></fA11><fA11 i1="02" i2="1"><s1>STANGIER (Christian)</s1></fA11><fA12 i1="01" i2="1"><s1>FLEISCHER (Rudolf)</s1><s9>ed.</s9></fA12><fA12 i1="02" i2="1"><s1>MORET (Bernard)</s1><s9>ed.</s9></fA12><fA12 i1="03" i2="1"><s1>MEINECHE SCHMIDT (Erik)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>University of Trier, Department of Computer Science</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></fA14><fA20><s1>139-162</s1></fA20><fA21><s1>2002</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA26 i1="01"><s0>3-540-00346-0</s0></fA26><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000108493890070</s5></fA43><fA44><s0>0000</s0><s1>© 2003 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>35 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>03-0184306</s0></fA47><fA60><s1>P</s1><s2>C</s2></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fC02 i1="01" i2="X"><s0>001D03F06B</s0></fC02><fC02 i1="02" i2="X"><s0>001D02A05</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Conception circuit</s0><s5>03</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Circuit design</s0><s5>03</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Diseño circuito</s0><s5>03</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Circuit VLSI</s0><s5>04</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>VLSI circuit</s0><s5>04</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Circuito VLSI</s0><s5>04</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Méthode heuristique</s0><s5>05</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Heuristic method</s0><s5>05</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Método heurístico</s0><s5>05</s5></fC03><fC03 i1="04" i2="3" l="FRE"><s0>Vérification formelle</s0><s5>06</s5></fC03><fC03 i1="04" i2="3" l="ENG"><s0>Formal verification</s0><s5>06</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Diagramme binaire décision</s0><s5>07</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Binary decision diagram</s0><s5>07</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Diagrama binaria decisión</s0><s5>07</s5></fC03><fC03 i1="06" i2="3" l="FRE"><s0>Analyse atteignabilité</s0><s5>08</s5></fC03><fC03 i1="06" i2="3" l="ENG"><s0>Reachability analysis</s0><s5>08</s5></fC03><fN21><s1>104</s1></fN21><fN82><s1>PSI</s1></fN82></pA><pR><fA30 i1="01" i2="1" l="ENG"><s1>Schloss Dagstuhl seminar on experimental algorithmics</s1><s2>1</s2><s3>Dagstuhl DEU</s3><s4>2000-09</s4></fA30></pR></standard></inist><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name></region><name sortKey="Stangier, Christian" sort="Stangier, Christian" uniqKey="Stangier C" first="Christian" last="Stangier">Christian Stangier</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000B26 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000B26 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:03-0184306
|texte= Algorithms and heuristics in VLSI design
}}
| This area was generated with Dilib version V0.6.31. |  |