Comedienne
发表于 2025-3-26 21:36:25
http://reply.papertrans.cn/15/1470/146991/146991_31.png
SOB
发表于 2025-3-27 04:29:50
http://reply.papertrans.cn/15/1470/146991/146991_32.png
释放
发表于 2025-3-27 05:59:28
https://doi.org/10.1007/978-981-13-8863-7 intervals, we have developed a method for representing temporal cases inside the knowledge-intensive CBR system Creek. The paper presents the theoretical foundation of the method, the representation formalism and basic reasoning algorithms, and an example applied to the prediction of unwanted events in oil well drilling.
连锁
发表于 2025-3-27 11:00:44
http://reply.papertrans.cn/15/1470/146991/146991_34.png
abracadabra
发表于 2025-3-27 14:59:08
S. Srivastava,W.-H. Soe,C. Joachim new approach to retrieval which is designed to deliver such . increases in diversity when possible. We also present a more widely applicable approach to increasing diversity in which the requirement that similarity is fully preserved is relaxed to allow some loss of similarity, provided it is strictly controlled.
主动脉
发表于 2025-3-27 20:50:31
http://reply.papertrans.cn/15/1470/146991/146991_36.png
相反放置
发表于 2025-3-28 00:46:57
https://doi.org/10.1007/978-1-4842-5034-1es of the CBR-cycle and the process requirements of a knowledge management system. The nature of knowledge within an organisation is briefly discussed and the paper illustrates the dynamic relationship between data, information and knowledge, showing how CBR can be used to help manage the acquisition and reuse of knowledge.
加入
发表于 2025-3-28 02:33:33
http://reply.papertrans.cn/15/1470/146991/146991_38.png
Inveterate
发表于 2025-3-28 07:29:25
Finding Balance Through the Rule of Threeadaptation. As a consequence, adaptation knowledge can be made directly available during similarity assessment and for explanation purposes. The use of a uniform model also provides the possibility of a . approach to adaptation..The model is compared with other approaches to adaptation within ..
HALO
发表于 2025-3-28 10:38:31
https://doi.org/10.1007/978-3-319-07689-8the area covered by the generalized cases, with respect to some given similarity measure. We formulate this problem as a mathematical optimization problem and we propose a new cutting plane method which enables us to rank generalized cases according to their distance to the query.