the current internet inherently has a degree of survivability due to the connection less ip protocol. dynamic routing protocols are designed to react to faults by changing routes when routers learn about topology changes via routing information updates (e.g., link status advertisements). loss of quality of service (qos) has not been an issue because current internet traffic is the best-effort. ...

imagine you have traveled to an unfamiliar city. before you start your daily tour around the city, you need to know a good route. in network theory (nt), this is the traveling salesman problem (tsp). a dynamic programming algorithm is often used for solving this problem. however, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

The aim of this position paper is to stress the need for considering an event-oriented perspective when modelling problem situations in Textual Case-Based Reasoning (TCBR). Therefore, we give several examples where events appear naturally on the text and can serve as basis for constructing features for cases. We also argue that the current, single-sided, object-oriented perspective is due to th...

In this paper we present a novel methodology for textual case-based reasoning. This technique is unique in that it automatically discovers case and similarity knowledge, is language independent, is scaleable and facilitates semantic similarity between cases to be carried out inherently without the need for domain knowledge. In addition it provides an insight into the thematical content of the c...

Textual-case based reasoning (TCBR) systems where the problem and solution are in free text form are hard to evaluate. In the absence of class information, domain experts are needed to evaluate solution quality, and provide relevance information. This approach is costly and time consuming. We propose three measures that can be used to compare alternate TCBR system configurations, in the absence...

In this paper, we argue that syntactic analysis is most likely to improve retrieval accuracy in textual case-based reasoning when the task of the system is well-defined and the relationship between queries and cases is specified in terms of this task. We illustrate this claim with an implemented system for syntax-based answer-indexed retrieval, RealDialog.

This is the first paper on textual case-based reasoning to employ collective classification, a methodology for simultaneously classifying related cases that has consistently attained higher accuracies than standard classification approaches when cases are related. Thus far, case-based classifiers have not been examined for their use in collective classification. We introduce Case-Based Collecti...

xvi

Our application is the configuration of telecooperation systems. The need for new configuration systems in this area matches well with the advances in the AI domain. We argue that case-based reasoning is very useful in the configuration of telecooperation systems and show the extension of an existing resource-oriented configurator to reason with cases. Finally we present a general method from c...