<?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-02374471</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-12T14:03:05+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Earliest-Completion Scheduling of Contract Algorithms with End Guarantees</title>
            <author role="aut">
              <persName>
                <forename type="first">Spyros</forename>
                <surname>Angelopoulos</surname>
              </persName>
              <email type="md5">093cd5f8095e9473209010113ec8b952</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">spyros-angelopoulos</idno>
              <idno type="idhal" notation="numeric">738275</idno>
              <idno type="halauthorid" notation="string">26508-738275</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9819-9158</idno>
              <idno type="IDREF">https://www.idref.fr/250394448</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Shendan</forename>
                <surname>Jin</surname>
              </persName>
              <idno type="halauthorid">1549522-0</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Spyros</forename>
                <surname>Angelopoulos</surname>
              </persName>
              <email type="md5">093cd5f8095e9473209010113ec8b952</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-11-21 15:05:47</date>
              <date type="whenModified">2024-10-30 13:32:32</date>
              <date type="whenReleased">2019-11-21 15:05:47</date>
              <date type="whenProduced">2019-08-10</date>
              <ref type="externalLink" target="https://www.ijcai.org/proceedings/2019/0763.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="450257">
                <persName>
                  <forename>Spyros</forename>
                  <surname>Angelopoulos</surname>
                </persName>
                <email type="md5">093cd5f8095e9473209010113ec8b952</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02374471</idno>
            <idno type="halUri">https://hal.science/hal-02374471</idno>
            <idno type="halBibtex">angelopoulos:hal-02374471</idno>
            <idno type="halRefHtml">&lt;i&gt;Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}&lt;/i&gt;, Aug 2019, Macao, Macau SAR China. pp.5493-5499, &lt;a target="_blank" href="https://dx.doi.org/10.24963/ijcai.2019/763"&gt;&amp;#x27E8;10.24963/ijcai.2019/763&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}, Aug 2019, Macao, Macau SAR China. pp.5493-5499, &amp;#x27E8;10.24963/ijcai.2019/763&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <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="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</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">Earliest-Completion Scheduling of Contract Algorithms with End Guarantees</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Spyros</forename>
                    <surname>Angelopoulos</surname>
                  </persName>
                  <email type="md5">093cd5f8095e9473209010113ec8b952</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">spyros-angelopoulos</idno>
                  <idno type="idhal" notation="numeric">738275</idno>
                  <idno type="halauthorid" notation="string">26508-738275</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9819-9158</idno>
                  <idno type="IDREF">https://www.idref.fr/250394448</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Shendan</forename>
                    <surname>Jin</surname>
                  </persName>
                  <idno type="halauthorid">1549522-0</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}</title>
                  <date type="start">2019-08-10</date>
                  <date type="end">2019-08-16</date>
                  <settlement>Macao</settlement>
                  <country key="MO">Macau SAR China</country>
                </meeting>
                <imprint>
                  <publisher>International Joint Conferences on Artificial Intelligence Organization</publisher>
                  <biblScope unit="pp">5493-5499</biblScope>
                  <date type="datePub">2019-07</date>
                </imprint>
              </monogr>
              <idno type="doi">10.24963/ijcai.2019/763</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>We consider the setting in which executions of contract algorithms are scheduled in a processor so as to produce an interruptible system. Such algorithms offer a trade off between the quality of output and the available computation time, provided that the latter is known in advance. Previous work on this setting has provided strict performance guarantees for several variants of this setting, assuming that an interruption can occur arbitrarily ahead in the future. In practice, however, one expects that the schedule will reach a point beyond which further progress will only be marginal, hence it can be deemed complete. In this work we show how to optimize the time at which the system reaches a desired performance objective, while maintaining interruptible guarantees throughout the entire execution. The resulting schedule is provably optimal, and it guarantees that upon completion each individual contract algorithm has attained a predefined end guarantee.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541718" status="VALID">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</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-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.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>