Virtual Components Design and Reuse 2001
DOI: 10.1007/978-1-4757-3275-7_8
|View full text |Cite
|
Sign up to set email alerts
|

IP Retrieval by Solving Constraint Satisfaction Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2003
2003
2005
2005

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…The retrieval algorithm which the retrieval engine uses is not described here. Instead one can make use of already existing sophisticated algorithms like those outlined in [37,38]. Of course, the IPs are only returned on a metadata level; that is, the IP Characterization is provided.…”
Section: Two-stepped Retrieval Processmentioning
confidence: 99%
“…The retrieval algorithm which the retrieval engine uses is not described here. Instead one can make use of already existing sophisticated algorithms like those outlined in [37,38]. Of course, the IPs are only returned on a metadata level; that is, the IP Characterization is provided.…”
Section: Two-stepped Retrieval Processmentioning
confidence: 99%
“…Besides the applications in the areas of planning (Kolodner, 1993), diagnosis (Watson and Abdullah, 1994), design (Perera and Watson, 1995), process control (Koegst, Schneider, Bergmann and Vollrath, 1999), there is a growing trend for enterprises to apply CBR technology in purchasing decision-making, which results in faster, more accurate, more consistent, higher quality and less expensive decisions (Cook, 1997). In addition, Mclvor and Humphreys (2000) apply CBR technology with multi-attribute analysis in the make or buy decision-making process.…”
Section: Cbrmentioning
confidence: 99%