UnivTrevesV1, PascalFrancis, Curation, bibRecord, 000369

MINLP based retrieval of generalized cases

Identifieur interne : 000369 ( PascalFrancis/Curation ); précédent : 000368; suivant : 000370

MINLP based retrieval of generalized cases

Auteurs : Alexander Tartakovski [Allemagne] ; Martin Schaaf [Allemagne] ; Rainer Maximini [Allemagne] ; Ralph Bergmann [Allemagne]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2004.

RBID : Pascal:04-0492305

Descripteurs français

Pascal (Inist)
- Intelligence artificielle, Automatisation, Similitude, Temps réponse, Raisonnement basé sur cas, Programmation mixte, Réponse temporelle, Programmation non linéaire, Problème non linéaire, Programmation mathématique, Programmation partiellement en nombres entiers, Optimisation, Méthode optimisation, Composant logiciel.
Wicri :
- topic : Intelligence artificielle, Automatisation.

English descriptors

KwdEn :
- Artificial intelligence, Automation, Case based reasoning, Mathematical programming, Mixed integer programming, Mixed programming, Non linear programming, Nonlinear problems, Optimization, Optimization method, Response time, Similarity, Software component, Time response.

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.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 3155`
A08	`01`	`1`	`ENG`	`@1 MINLP based retrieval of generalized cases`
A09	`01`	`1`	`ENG`	`@1 Advances in case-based reasoning : Madrid, 30 August - 2 September 2004`
A11	`01`	`1`		`@1 TARTAKOVSKI (Alexander)`
A11	`02`	`1`		`@1 SCHAAF (Martin)`
A11	`03`	`1`		`@1 MAXIMINI (Rainer)`
A11	`04`	`1`		`@1 BERGMANN (Ralph)`
A12	`01`	`1`		`@1 FUNK (Peter) @9 ed.`
A12	`02`	`1`		`@1 GONZALEZ CALERO (Pedro A.) @9 ed.`
A14	`01`			`@1 University of Trier, Department of Business Information Systems II @2 54286 Trier @3 DEU @Z 1 aut. @Z 3 aut. @Z 4 aut.`
A14	`02`			`@1 University of Hildesheim, Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group @2 31113 Hildesheim @3 DEU @Z 2 aut.`
A20				`@1 404-418`
A21				`@1 2004`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-22882-9`
A43	`01`			`@1 INIST @2 16343 @5 354000117917880290`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 14 ref.`
A47	`01`	`1`		`@0 04-0492305`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	@0 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.
C02	`01`	`X`		`@0 001D02C02`
C03	`01`	`X`	`FRE`	`@0 Intelligence artificielle @5 01`
C03	`01`	`X`	`ENG`	`@0 Artificial intelligence @5 01`
C03	`01`	`X`	`SPA`	`@0 Inteligencia artificial @5 01`
C03	`02`	`X`	`FRE`	`@0 Automatisation @5 06`
C03	`02`	`X`	`ENG`	`@0 Automation @5 06`
C03	`02`	`X`	`SPA`	`@0 Automatización @5 06`
C03	`03`	`X`	`FRE`	`@0 Similitude @5 07`
C03	`03`	`X`	`ENG`	`@0 Similarity @5 07`
C03	`03`	`X`	`SPA`	`@0 Similitud @5 07`
C03	`04`	`X`	`FRE`	`@0 Temps réponse @5 08`
C03	`04`	`X`	`ENG`	`@0 Response time @5 08`
C03	`04`	`X`	`SPA`	`@0 Tiempo respuesta @5 08`
C03	`05`	`X`	`FRE`	`@0 Raisonnement basé sur cas @5 18`
C03	`05`	`X`	`ENG`	`@0 Case based reasoning @5 18`
C03	`05`	`X`	`SPA`	`@0 Razonamiento fundado sobre caso @5 18`
C03	`06`	`X`	`FRE`	`@0 Programmation mixte @5 19`
C03	`06`	`X`	`ENG`	`@0 Mixed programming @5 19`
C03	`06`	`X`	`SPA`	`@0 Programación mixta @5 19`
C03	`07`	`X`	`FRE`	`@0 Réponse temporelle @5 20`
C03	`07`	`X`	`ENG`	`@0 Time response @5 20`
C03	`07`	`X`	`SPA`	`@0 Respuesta temporal @5 20`
C03	`08`	`X`	`FRE`	`@0 Programmation non linéaire @5 23`
C03	`08`	`X`	`ENG`	`@0 Non linear programming @5 23`
C03	`08`	`X`	`SPA`	`@0 Programación no lineal @5 23`
C03	`09`	`3`	`FRE`	`@0 Problème non linéaire @5 24`
C03	`09`	`3`	`ENG`	`@0 Nonlinear problems @5 24`
C03	`10`	`X`	`FRE`	`@0 Programmation mathématique @5 25`
C03	`10`	`X`	`ENG`	`@0 Mathematical programming @5 25`
C03	`10`	`X`	`SPA`	`@0 Programación matemática @5 25`
C03	`11`	`X`	`FRE`	`@0 Programmation partiellement en nombres entiers @5 26`
C03	`11`	`X`	`ENG`	`@0 Mixed integer programming @5 26`
C03	`11`	`X`	`SPA`	`@0 Programación mixta entera @5 26`
C03	`12`	`X`	`FRE`	`@0 Optimisation @5 27`
C03	`12`	`X`	`ENG`	`@0 Optimization @5 27`
C03	`12`	`X`	`SPA`	`@0 Optimización @5 27`
C03	`13`	`X`	`FRE`	`@0 Méthode optimisation @5 28`
C03	`13`	`X`	`ENG`	`@0 Optimization method @5 28`
C03	`13`	`X`	`SPA`	`@0 Método optimización @5 28`
C03	`14`	`X`	`FRE`	`@0 Composant logiciel @4 CD @5 96`
C03	`14`	`X`	`ENG`	`@0 Software component @4 CD @5 96`
C03	`14`	`X`	`SPA`	`@0 Componente logicial @4 CD @5 96`
N21				`@1 278`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

A30	`01`	`1`	`ENG`	`@1 ECCBR 2004 : European conference on case-based reasoning @2 7 @3 Madrid ESP @4 2004-08-30`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000B34

Links to Exploration step

Pascal:04-0492305

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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 wicri:level="1"><inist:fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University of Hildesheim, Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group</s1>
<s2>31113 Hildesheim</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0492305</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 04-0492305 INIST</idno>
<idno type="RBID">Pascal:04-0492305</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B34</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000369</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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 wicri:level="1"><inist:fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Schaaf, Martin" sort="Schaaf, Martin" uniqKey="Schaaf M" first="Martin" last="Schaaf">Martin Schaaf</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University of Hildesheim, Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group</s1>
<s2>31113 Hildesheim</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Maximini, Rainer" sort="Maximini, Rainer" uniqKey="Maximini R" first="Rainer" last="Maximini">Rainer Maximini</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Bergmann, Ralph" sort="Bergmann, Ralph" uniqKey="Bergmann R" first="Ralph" last="Bergmann">Ralph Bergmann</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2004">2004</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>Artificial intelligence</term>
<term>Automation</term>
<term>Case based reasoning</term>
<term>Mathematical programming</term>
<term>Mixed integer programming</term>
<term>Mixed programming</term>
<term>Non linear programming</term>
<term>Nonlinear problems</term>
<term>Optimization</term>
<term>Optimization method</term>
<term>Response time</term>
<term>Similarity</term>
<term>Software component</term>
<term>Time response</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Automatisation</term>
<term>Similitude</term>
<term>Temps réponse</term>
<term>Raisonnement basé sur cas</term>
<term>Programmation mixte</term>
<term>Réponse temporelle</term>
<term>Programmation non linéaire</term>
<term>Problème non linéaire</term>
<term>Programmation mathématique</term>
<term>Programmation partiellement en nombres entiers</term>
<term>Optimisation</term>
<term>Méthode optimisation</term>
<term>Composant logiciel</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Automatisation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>3155</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>MINLP based retrieval of generalized cases</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Advances in case-based reasoning : Madrid, 30 August - 2 September 2004</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>TARTAKOVSKI (Alexander)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SCHAAF (Martin)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>MAXIMINI (Rainer)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>BERGMANN (Ralph)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>FUNK (Peter)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>GONZALEZ CALERO (Pedro A.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>University of Trier, Department of Business Information Systems II</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>University of Hildesheim, Institute for Mathematics and Applied Computer Science, Data and Knowledge Management Group</s1>
<s2>31113 Hildesheim</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>404-418</s1>
</fA20>
<fA21><s1>2004</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-22882-9</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117917880290</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>14 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0492305</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>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Automatisation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Automation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Automatización</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Similitude</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Similarity</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Similitud</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Temps réponse</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Response time</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Tiempo respuesta</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Raisonnement basé sur cas</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Case based reasoning</s0>
<s5>18</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Razonamiento fundado sobre caso</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Programmation mixte</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Mixed programming</s0>
<s5>19</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Programación mixta</s0>
<s5>19</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Réponse temporelle</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Time response</s0>
<s5>20</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Respuesta temporal</s0>
<s5>20</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Programmation non linéaire</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Non linear programming</s0>
<s5>23</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Programación no lineal</s0>
<s5>23</s5>
</fC03>
<fC03 i1="09" i2="3" l="FRE"><s0>Problème non linéaire</s0>
<s5>24</s5>
</fC03>
<fC03 i1="09" i2="3" l="ENG"><s0>Nonlinear problems</s0>
<s5>24</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Programmation mathématique</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Mathematical programming</s0>
<s5>25</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Programación matemática</s0>
<s5>25</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Programmation partiellement en nombres entiers</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Mixed integer programming</s0>
<s5>26</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Programación mixta entera</s0>
<s5>26</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Optimisation</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Optimization</s0>
<s5>27</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Optimización</s0>
<s5>27</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Méthode optimisation</s0>
<s5>28</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Optimization method</s0>
<s5>28</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Método optimización</s0>
<s5>28</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Composant logiciel</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Software component</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Componente logicial</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>278</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ECCBR 2004 : European conference on case-based reasoning</s1>
<s2>7</s2>
<s3>Madrid ESP</s3>
<s4>2004-08-30</s4>
</fA30>
</pR>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000369 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000369 | 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=   Curation
   |type=    RBID
   |clé=     Pascal:04-0492305
   |texte=   MINLP based retrieval of generalized cases
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

MINLP based retrieval of generalized cases

MINLP based retrieval of generalized cases

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri