<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00940983</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T05:59:20+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">An approximation algorithm for testing memories of an integrated circuit</title>
            <author role="aut">
              <persName>
                <forename type="first">Lilia</forename>
                <surname>Zaourar</surname>
              </persName>
              <email type="md5">56521e3c22f2f346fea211f575332b09</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">951995</idno>
              <idno type="halauthorid" notation="string">643592-951995</idno>
              <affiliation ref="#struct-398846"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alix</forename>
                <surname>Munier-Kordon</surname>
              </persName>
              <email type="md5">1054f36bd506487945af1c368bf55e1e</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">alix-munier-kordon</idno>
              <idno type="idhal" notation="numeric">9539</idno>
              <idno type="halauthorid" notation="string">3281-9539</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2170-6366</idno>
              <idno type="IDREF">https://www.idref.fr/159831458</idno>
              <idno type="VIAF">https://viaf.org/viaf/280614296</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/FQB-1000-2022</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/FQB-1000-2022</idno>
              <affiliation ref="#struct-398846"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lilia</forename>
                <surname>Zaourar</surname>
              </persName>
              <email type="md5">d7724e66523009052729ad0530594154</email>
              <email type="domain">g-scop.inpg.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-02-03 11:12:53</date>
              <date type="whenWritten">2012-05-29</date>
              <date type="whenModified">2025-10-16 10:08:25</date>
              <date type="whenReleased">2014-02-06 11:38:26</date>
              <date type="whenProduced">2012-05-28</date>
              <date type="whenEndEmbargoed">2014-02-03</date>
              <ref type="file" target="https://hal.science/hal-00940983v1/document">
                <date notBefore="2014-02-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00940983v1/file/bppc12_submission_7-1.pdf" id="file-940983-403968">
                <date notBefore="2014-02-03"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="141575">
                <persName>
                  <forename>Lilia</forename>
                  <surname>Zaourar</surname>
                </persName>
                <email type="md5">d7724e66523009052729ad0530594154</email>
                <email type="domain">g-scop.inpg.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00940983</idno>
            <idno type="halUri">https://hal.science/hal-00940983</idno>
            <idno type="halBibtex">zaourar:hal-00940983</idno>
            <idno type="halRefHtml">&lt;i&gt;Fourth International Workshop on Bin Packing and Placement Constraints BPPC'12&lt;/i&gt;, May 2012, Nantes, France. pp.1-6</idno>
            <idno type="halRef">Fourth International Workshop on Bin Packing and Placement Constraints BPPC'12, May 2012, Nantes, France. pp.1-6</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-940983-403968"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">An approximation algorithm for testing memories of an integrated circuit</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lilia</forename>
                    <surname>Zaourar</surname>
                  </persName>
                  <email type="md5">56521e3c22f2f346fea211f575332b09</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">951995</idno>
                  <idno type="halauthorid" notation="string">643592-951995</idno>
                  <affiliation ref="#struct-398846"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alix</forename>
                    <surname>Munier-Kordon</surname>
                  </persName>
                  <email type="md5">1054f36bd506487945af1c368bf55e1e</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">alix-munier-kordon</idno>
                  <idno type="idhal" notation="numeric">9539</idno>
                  <idno type="halauthorid" notation="string">3281-9539</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2170-6366</idno>
                  <idno type="IDREF">https://www.idref.fr/159831458</idno>
                  <idno type="VIAF">https://viaf.org/viaf/280614296</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/FQB-1000-2022</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/FQB-1000-2022</idno>
                  <affiliation ref="#struct-398846"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Fourth International Workshop on Bin Packing and Placement Constraints BPPC'12</title>
                <meeting>
                  <title>Fourth International Workshop on Bin Packing and Placement Constraints BPPC'12</title>
                  <date type="start">2012-05-28</date>
                  <date type="end">2012-06-01</date>
                  <settlement>Nantes</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">1-6</biblScope>
                  <date type="datePub">2012-05-29</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Memory testing of an integrated circuit is a real industrial challenge, and presents several interesting original combinatorial opti- mization problems. A simple model for testing a set of memories, tak- ing into account their test time and power, is first presented. Feasible solutions consist on grouping memories into lots of a maximum fixed power. The aim is to minimize the overall test time for a unique sequen- tial tester. The problem includes the classical Bin-Packing problem and thus is N P -hard. A simple lower bound of the overall test time is first obtained using a continuous version of the problem. A simple heuris- tic issued from a Next Fit Decreasing strategy is then presented and its performance ratio is proved to be bounded by 2.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-398846" status="OLD">
          <orgName>Architecture et Logiciels pour Systèmes Embarqués sur Puce</orgName>
          <orgName type="acronym">ALSOC</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>