MINLP Based Retrieval of Generalized Cases
Identifieur interne : 001253 ( Istex/Corpus ); précédent : 001252; suivant : 001254MINLP Based Retrieval of Generalized Cases
Auteurs : Alexander Tartakovski ; Martin Schaaf ; Rainer Maximini ; Ralph BergmannSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Abstract
Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.
Url:
DOI: 10.1007/978-3-540-28631-8_30
Links to Exploration step
ISTEX:ADBD492C52484354649BDD1BFBB1A6419A585CFCLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">MINLP Based Retrieval of Generalized Cases</title><author><name sortKey="Tartakovski, Alexander" sort="Tartakovski, Alexander" uniqKey="Tartakovski A" first="Alexander" last="Tartakovski">Alexander Tartakovski</name><affiliation><mods:affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: tartakov@wi2.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name><affiliation><mods:affiliation>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group, University of Hildesheim, 31113, Hildesheim, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: schaaf@dwm.uni-hildesheim.de</mods:affiliation></affiliation></author><author><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name><affiliation><mods:affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rmaximini@wi2.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann</name><affiliation><mods:affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bergmann@wi2.uni-trier.de</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:ADBD492C52484354649BDD1BFBB1A6419A585CFC</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-28631-8_30</idno><idno type="url">https://api.istex.fr/document/ADBD492C52484354649BDD1BFBB1A6419A585CFC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001253</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001253</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">MINLP Based Retrieval of Generalized Cases</title><author><name sortKey="Tartakovski, Alexander" sort="Tartakovski, Alexander" uniqKey="Tartakovski A" first="Alexander" last="Tartakovski">Alexander Tartakovski</name><affiliation><mods:affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: tartakov@wi2.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name><affiliation><mods:affiliation>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group, University of Hildesheim, 31113, Hildesheim, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: schaaf@dwm.uni-hildesheim.de</mods:affiliation></affiliation></author><author><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name><affiliation><mods:affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rmaximini@wi2.uni-trier.de</mods:affiliation></affiliation></author><author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann</name><affiliation><mods:affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bergmann@wi2.uni-trier.de</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">ADBD492C52484354649BDD1BFBB1A6419A585CFC</idno><idno type="DOI">10.1007/978-3-540-28631-8_30</idno><idno type="ChapterID">30</idno><idno type="ChapterID">Chap30</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Alexander Tartakovski</name><affiliations><json:string>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</json:string><json:string>E-mail: tartakov@wi2.uni-trier.de</json:string></affiliations></json:item><json:item><name>Martin Schaaf</name><affiliations><json:string>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group, University of Hildesheim, 31113, Hildesheim, Germany</json:string><json:string>E-mail: schaaf@dwm.uni-hildesheim.de</json:string></affiliations></json:item><json:item><name>Rainer Maximini</name><affiliations><json:string>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</json:string><json:string>E-mail: rmaximini@wi2.uni-trier.de</json:string></affiliations></json:item><json:item><name>Ralph Bergmann</name><affiliations><json:string>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</json:string><json:string>E-mail: bergmann@wi2.uni-trier.de</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.</abstract><qualityIndicators><score>6.314</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1009</abstractCharCount><pdfWordCount>4670</pdfWordCount><pdfCharCount>26380</pdfCharCount><pdfPageCount>15</pdfPageCount><abstractWordCount>137</abstractWordCount></qualityIndicators><title>MINLP Based Retrieval of Generalized Cases</title><chapterId><json:string>30</json:string><json:string>Chap30</json:string></chapterId><refBibs><json:item><host><author></author><title>IF NOT Split?(CB) THEN RETURN MakeBucket(CB) 2</title></host></json:item><json:item><host><author></author><title>Discriminator := SelectAttribute(CB)</title></host></json:item><json:item><host><author></author><title>IF OrderedValueRange(Discriminator) THEN</title></host></json:item><json:item><host><author></author><title>Value := SelectValue(CB, Discriminator)</title></host></json:item><json:item><host><author><json:item><name>Endif Endif</name></json:item></author></host></json:item><json:item><host><author><json:item><name>R Bergmann</name></json:item><json:item><name>I Vollrath</name></json:item><json:item><name>T Wahlmann</name></json:item></author><title>Generalized cases and their application to electronic design</title><publicationDate>1999</publicationDate></host></json:item><json:item><host><author><json:item><name>R Bergmann</name></json:item></author><title>Experience management</title><publicationDate>2002</publicationDate></host></json:item><json:item><author><json:item><name>B Mougouie</name></json:item><json:item><name>R Bergmann</name></json:item></author><host><author></author><title>Lecture Notes in Artificial Intelligence</title><publicationDate>2002</publicationDate></host><title>Similarity assessment for generalized cases by optimization methods European Conference on Case- Based Reasoning (ECCBR'02)</title><publicationDate>2002</publicationDate></json:item><json:item><host><author><json:item><name>J Lewis</name></json:item></author><title>Intellectual property (ip) components. Artisan Components</title><publicationDate>1997-10-28</publicationDate></host></json:item><json:item><author><json:item><name>M Schaaf</name></json:item><json:item><name>R Maximini</name></json:item><json:item><name>R Bergmann</name></json:item><json:item><name>C Tautz</name></json:item><json:item><name>R Traphöner</name></json:item></author><host><author></author><title>Proceedings 6th European Conference on Case Based Reasoning</title><publicationDate>2002-09</publicationDate></host><title>Supporting electronic design reuse by integrating quality-criteria into cbr-based ip selection</title><publicationDate>2002-09</publicationDate></json:item><json:item><host><pages><first>99</first></pages><author><json:item><name>R Bergmann</name></json:item><json:item><name>I Vollrath</name></json:item></author><title>Generalized cases: Representation and steps towards e.cient similarity assessment</title><publicationDate>1999</publicationDate></host></json:item><json:item><author><json:item><name>M,S Bazaraa</name></json:item><json:item><name>H,D Sherali</name></json:item><json:item><name>C,M Shetty</name></json:item></author><host><author></author><title>Nonlinear programming, theory and algorithms</title><publicationDate>1993</publicationDate></host><publicationDate>1993</publicationDate></json:item><json:item><host><author><json:item><name>S Leyffer</name></json:item></author><title>Deterministic methods for mixed integer nonlinear programming</title><publicationDate>1993</publicationDate></host></json:item><json:item><host><author><json:item><name>M Tawarmalani</name></json:item><json:item><name>N Sahinidis</name></json:item></author><title>Convexification and global optimization in continuous and mixed-integer nonlinear programming: Theory, algorithms, software, and applications</title><publicationDate>2002</publicationDate></host></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>H Tuy</name></json:item></author><host><author></author><title>Edition</title><publicationDate>1993</publicationDate></host><title>Global optimization: Deterministic approaches. 2nd rev</title><publicationDate>1993</publicationDate></json:item><json:item><host><author><json:item><name>S Wess</name></json:item><json:item><name>K,D Altho</name></json:item><json:item><name>G Derwand</name></json:item></author><title>Using k-d trees to improve the retrieval step in case-based reasoning</title><publicationDate>1993</publicationDate></host></json:item><json:item><host><author><json:item><name>J,L Kolodner</name></json:item></author><title>Retrieval and organizational strategies in conceptual memory</title><publicationDate>1980</publicationDate></host></json:item><json:item><author><json:item><name>K Maximini</name></json:item><json:item><name>R Maximini</name></json:item><json:item><name>R Bergmann</name></json:item></author><host><author></author><title>Proceedings of 5th International Conference on Case Base Reasoning (ICCBR'03)</title><publicationDate>2003-06</publicationDate></host><title>An investigation of generalized cases: Theory, algorithms, software, and applications</title><publicationDate>2003-06</publicationDate></json:item><json:item><author><json:item><name>R Maximini</name></json:item><json:item><name>A Tartakovski</name></json:item><json:item><name>R Bergmann</name></json:item></author><host><author></author><title>Stumme G.(Hrsg). WM2003: Professionelles Wissensmanagement-Erfahrungen und Visionen</title><publicationDate>2003</publicationDate></host><title>Investigating different methods for efficient retrieval of generalized cases</title><publicationDate>2003</publicationDate></json:item></refBibs><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>New York University, NY, USA</json:string></affiliations></json:item><json:item><name>Dough Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbruecken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2004</copyrightDate></serie><host><editor><json:item><name>Peter Funk</name><affiliations><json:string>Department of Computer Science and Electronics, Mälardalen University, SE-72123, Västerås, Sweden</json:string><json:string>E-mail: Peter.Funk@mdh.se</json:string></affiliations></json:item><json:item><name>Pedro A. González Calero</name><affiliations><json:string>Facultad de Informática, Universidad Complutense de Madrid, 28040, Madrid, Spain</json:string><json:string>E-mail: pedro@sip.ucm.es</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Computer Appl. in Administrative Data Processing</value></json:item><json:item><value>Computer Appl. in Social and Behavioral Sciences</value></json:item></subject><isbn><json:string>978-3-540-22882-0</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Advances in Case-Based Reasoning</title><bookId><json:string>978-3-540-28631-8</json:string></bookId><volume>3155</volume><pages><last>418</last><first>404</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-28631-8</json:string></eisbn><copyrightDate>2004</copyrightDate><doi><json:string>10.1007/b99702</json:string></doi></host><publicationDate>2004</publicationDate><copyrightDate>2004</copyrightDate><doi><json:string>10.1007/978-3-540-28631-8_30</json:string></doi><id>ADBD492C52484354649BDD1BFBB1A6419A585CFC</id><score>1.0518856</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/ADBD492C52484354649BDD1BFBB1A6419A585CFC/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/ADBD492C52484354649BDD1BFBB1A6419A585CFC/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/ADBD492C52484354649BDD1BFBB1A6419A585CFC/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">MINLP Based Retrieval of Generalized Cases</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2004</p></availability><date>2004</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">MINLP Based Retrieval of Generalized Cases</title><author xml:id="author-1"><persName><forename type="first">Alexander</forename><surname>Tartakovski</surname></persName><email>tartakov@wi2.uni-trier.de</email><affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Martin</forename><surname>Schaaf</surname></persName><email>schaaf@dwm.uni-hildesheim.de</email><affiliation>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group, University of Hildesheim, 31113, Hildesheim, Germany</affiliation></author><author xml:id="author-3"><persName><forename type="first">Rainer</forename><surname>Maximini</surname></persName><email>rmaximini@wi2.uni-trier.de</email><affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</affiliation></author><author xml:id="author-4"><persName><forename type="first">Ralph</forename><surname>Bergmann</surname></persName><email>bergmann@wi2.uni-trier.de</email><affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</affiliation></author></analytic><monogr><title level="m">Advances in Case-Based Reasoning</title><title level="m" type="sub">7th European Conference, ECCBR 2004, Madrid, Spain, August 30 - September 2, 2004. Proceedings</title><idno type="pISBN">978-3-540-22882-0</idno><idno type="eISBN">978-3-540-28631-8</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/b99702</idno><idno type="book-ID">978-3-540-28631-8</idno><idno type="book-title-ID">111871</idno><idno type="book-sequence-number">3155</idno><idno type="book-volume-number">3155</idno><idno type="book-chapter-count">58</idno><editor><persName><forename type="first">Peter</forename><surname>Funk</surname></persName><email>Peter.Funk@mdh.se</email><affiliation>Department of Computer Science and Electronics, Mälardalen University, SE-72123, Västerås, Sweden</affiliation></editor><editor><persName><forename type="first">Pedro</forename><forename type="first">A.</forename><surname>González Calero</surname></persName><email>pedro@sip.ucm.es</email><affiliation>Facultad de Informática, Universidad Complutense de Madrid, 28040, Madrid, Spain</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2004"></date><biblScope unit="volume">3155</biblScope><biblScope unit="page" from="404">404</biblScope><biblScope unit="page" to="418">418</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>New York University, NY, USA</affiliation></editor><editor><persName><forename type="first">Dough</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation></editor><biblScope><date>2004</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><series><title level="s">Lecture Notes in Artificial Intelligence</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>New York University, NY, USA</affiliation></editor><editor><persName><forename type="first">Dough</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation></editor><editor><persName><forename type="first">Jaime</forename><forename type="first">G.</forename><surname>Carbonell</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Jörg</forename><surname>Siekmann</surname></persName><affiliation>University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Peter</forename><surname>Funk</surname></persName><email>Peter.Funk@mdh.se</email><affiliation>Department of Computer Science and Electronics, Mälardalen University, SE-72123, Västerås, Sweden</affiliation></editor><editor><persName><forename type="first">Pedro</forename><forename type="first">A.</forename><surname>González Calero</surname></persName><email>pedro@sip.ucm.es</email><affiliation>Facultad de Informática, Universidad Complutense de Madrid, 28040, Madrid, Spain</affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><biblScope unit="seriesId">1244</biblScope></series><idno type="istex">ADBD492C52484354649BDD1BFBB1A6419A585CFC</idno><idno type="DOI">10.1007/978-3-540-28631-8_30</idno><idno type="ChapterID">30</idno><idno type="ChapterID">Chap30</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2004</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I21017</label><label>I16048</label><label>I2301X</label><label>I23028</label><item><term>Computer Science</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Mathematical Logic and Formal Languages</term></item><item><term>Computer Appl. in Administrative Data Processing</term></item><item><term>Computer Appl. in Social and Behavioral Sciences</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2004">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/ADBD492C52484354649BDD1BFBB1A6419A585CFC/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Dough</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>CA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><City>MA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>New York University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbruecken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName><GivenName>G.</GivenName><FamilyName>Carbonell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Affiliation ID="Aff16"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-28631-8</BookID><BookTitle>Advances in Case-Based Reasoning</BookTitle><BookSubTitle>7th European Conference, ECCBR 2004, Madrid, Spain, August 30 - September 2, 2004. Proceedings</BookSubTitle><BookVolumeNumber>3155</BookVolumeNumber><BookSequenceNumber>3155</BookSequenceNumber><BookDOI>10.1007/b99702</BookDOI><BookTitleID>111871</BookTitleID><BookPrintISBN>978-3-540-22882-0</BookPrintISBN><BookElectronicISBN>978-3-540-28631-8</BookElectronicISBN><BookChapterCount>58</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2004</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I2301X" Priority="3" Type="Secondary">Computer Appl. in Administrative Data Processing</BookSubject><BookSubject Code="I23028" Priority="4" Type="Secondary">Computer Appl. in Social and Behavioral Sciences</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID><SubSeriesID>1244</SubSeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Peter</GivenName><FamilyName>Funk</FamilyName></EditorName><Contact><Email>Peter.Funk@mdh.se</Email></Contact></Editor><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Pedro</GivenName><GivenName>A.</GivenName><FamilyName>González Calero</FamilyName></EditorName><Contact><Email>pedro@sip.ucm.es</Email></Contact></Editor><Affiliation ID="Aff18"><OrgDivision>Department of Computer Science and Electronics</OrgDivision><OrgName>Mälardalen University</OrgName><OrgAddress><Postcode>SE-72123</Postcode><City>Västerås</City><Country>Sweden</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgDivision>Facultad de Informática</OrgDivision><OrgName>Universidad Complutense de Madrid</OrgName><OrgAddress><Postcode>28040</Postcode><City>Madrid</City><Country>Spain</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID><PartSequenceNumber>2</PartSequenceNumber><PartTitle>Research Papers</PartTitle><PartChapterCount>31</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Advances in Case-Based Reasoning</BookTitle></PartContext></PartInfo><Chapter ID="Chap30" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>30</ChapterID><ChapterDOI>10.1007/978-3-540-28631-8_30</ChapterDOI><ChapterSequenceNumber>30</ChapterSequenceNumber><ChapterTitle Language="En">MINLP Based Retrieval of Generalized Cases</ChapterTitle><ChapterFirstPage>404</ChapterFirstPage><ChapterLastPage>418</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2004</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>2</PartID><BookID>978-3-540-28631-8</BookID><BookTitle>Advances in Case-Based Reasoning</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Alexander</GivenName><FamilyName>Tartakovski</FamilyName></AuthorName><Contact><Email>tartakov@wi2.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Martin</GivenName><FamilyName>Schaaf</FamilyName></AuthorName><Contact><Email>schaaf@dwm.uni-hildesheim.de</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Rainer</GivenName><FamilyName>Maximini</FamilyName></AuthorName><Contact><Email>rmaximini@wi2.uni-trier.de</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Ralph</GivenName><FamilyName>Bergmann</FamilyName></AuthorName><Contact><Email>bergmann@wi2.uni-trier.de</Email></Contact></Author><Affiliation ID="Aff20"><OrgDivision>Department of Business Information Systems II</OrgDivision><OrgName>University of Trier</OrgName><OrgAddress><Postcode>54286</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgDivision>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group</OrgDivision><OrgName>University of Hildesheim</OrgName><OrgAddress><Postcode>31113</Postcode><City>Hildesheim</City><Country>Germany</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>generalized cases</Keyword><Keyword>mixed integer nonlinear programming</Keyword><Keyword>kd-trees</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>MINLP Based Retrieval of Generalized Cases</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>MINLP Based Retrieval of Generalized Cases</title></titleInfo><name type="personal"><namePart type="given">Alexander</namePart><namePart type="family">Tartakovski</namePart><affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</affiliation><affiliation>E-mail: tartakov@wi2.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Martin</namePart><namePart type="family">Schaaf</namePart><affiliation>Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group, University of Hildesheim, 31113, Hildesheim, Germany</affiliation><affiliation>E-mail: schaaf@dwm.uni-hildesheim.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Rainer</namePart><namePart type="family">Maximini</namePart><affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</affiliation><affiliation>E-mail: rmaximini@wi2.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Ralph</namePart><namePart type="family">Bergmann</namePart><affiliation>Department of Business Information Systems II, University of Trier, 54286, Trier, Germany</affiliation><affiliation>E-mail: bergmann@wi2.uni-trier.de</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2004</dateIssued><copyrightDate encoding="w3cdtf">2004</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design automation. This paper addresses the similarity assessment and retrieval problem for case bases consisting of traditional and generalized cases. While approaches presented earlier were restricted to continuous domains, this paper addresses generalized cases defined over mixed, continuous and discrete, domains. It extends the view on the similarity assessment as a nonlinear optimization problem (NLP) towards a mixed integer nonlinear optimization problem (MINLP), which is an actual research topic in mathematical optimization. This is an important step because most real world applications require mixed domains for the case description. Furthermore, we introduce two optimization-based retrieval methods that operate on a previously created index structure, which restricts the retrieval response time significantly.</abstract><relatedItem type="host"><titleInfo><title>Advances in Case-Based Reasoning</title><subTitle>7th European Conference, ECCBR 2004, Madrid, Spain, August 30 - September 2, 2004. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Peter</namePart><namePart type="family">Funk</namePart><affiliation>Department of Computer Science and Electronics, Mälardalen University, SE-72123, Västerås, Sweden</affiliation><affiliation>E-mail: Peter.Funk@mdh.se</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Pedro</namePart><namePart type="given">A.</namePart><namePart type="family">González Calero</namePart><affiliation>Facultad de Informática, Universidad Complutense de Madrid, 28040, Madrid, Spain</affiliation><affiliation>E-mail: pedro@sip.ucm.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2004</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I2301X">Computer Appl. in Administrative Data Processing</topic><topic authority="SpringerSubjectCodes" authorityURI="I23028">Computer Appl. in Social and Behavioral Sciences</topic></subject><identifier type="DOI">10.1007/b99702</identifier><identifier type="ISBN">978-3-540-22882-0</identifier><identifier type="eISBN">978-3-540-28631-8</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">111871</identifier><identifier type="BookID">978-3-540-28631-8</identifier><identifier type="BookChapterCount">58</identifier><identifier type="BookVolumeNumber">3155</identifier><identifier type="BookSequenceNumber">3155</identifier><identifier type="PartChapterCount">31</identifier><part><date>2004</date><detail type="part"><title>Research Papers</title></detail><detail type="volume"><number>3155</number><caption>vol.</caption></detail><extent unit="pages"><start>404</start><end>418</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>New York University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dough</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2004</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>New York University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dough</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jaime</namePart><namePart type="given">G.</namePart><namePart type="family">Carbonell</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Peter</namePart><namePart type="family">Funk</namePart><affiliation>Department of Computer Science and Electronics, Mälardalen University, SE-72123, Västerås, Sweden</affiliation><affiliation>E-mail: Peter.Funk@mdh.se</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Pedro</namePart><namePart type="given">A.</namePart><namePart type="family">González Calero</namePart><affiliation>Facultad de Informática, Universidad Complutense de Madrid, 28040, Madrid, Spain</affiliation><affiliation>E-mail: pedro@sip.ucm.es</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin></recordInfo></relatedItem><identifier type="istex">ADBD492C52484354649BDD1BFBB1A6419A585CFC</identifier><identifier type="DOI">10.1007/978-3-540-28631-8_30</identifier><identifier type="ChapterID">30</identifier><identifier type="ChapterID">Chap30</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2004</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001253 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001253 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:ADBD492C52484354649BDD1BFBB1A6419A585CFC
|texte= MINLP Based Retrieval of Generalized Cases
}}
| This area was generated with Dilib version V0.6.31. |  |