Adding knowledge to a knowledge-based system is not monotonically bene cial. We discuss and experimentally validate this observation in the context of CABINS, a system that learns control knowledge for iterative repair in ill-structured optimization problems. In CAB-INS, situation-dependent user's decisions that guide the repair process are captured in cases together with contextual problem information. During iterative revision in CABINS, cases are exploited for both selection of repair actions and evaluation of repair results. In this paper, we experimentally demonstrated that unltered learned knowledge can degrade problem solving performance. We developed and experimentally evaluated the e ectiveness of a set of knowledge ltering st...
Case-based reasoning (CBR) infers a solution to a new problem by searching a collection of previousl...
Many real world problems can be expressed as optimisation problems. Solving such problems means to f...
Discrete optimization problems are usually NP hard. When choosing or designing an algorithm for solv...
We describe a framework, implemented in CAB-INS, for iterative schedule revision based on acqui-siti...
AbstractPractical scheduling problems generally require allocation of resources in the presence of a...
The utility problem in learning systems occurs when knowledge learned in an attempt to improve a sys...
The knowledge stored in a case base is central to the problem solving of a case-based reasoning (CBR...
Case Based Reasoning (CBR) is an intelligent systems methodology that enables information managers t...
This paper presents a general learning method for dynamically selecting between repair heuristics in...
In this paper we present a Self-Optimizing module, inspired on Autonomic Computing, acquiring a sc...
computational analysis of these factors. We use this method to analyze different types of problem so...
Knowledge maintenance for Case-Based Reasoning systems is an important knowledge engineering task de...
Knowledge refinement tools seek to correct faulty rule-based systems by identifying and repairing fa...
Many real world problems can be expressed as optimisation problems. Solving this kind of problems me...
The inability of a problem solver to produce solutions of a desired quality often may lie in the inc...
Case-based reasoning (CBR) infers a solution to a new problem by searching a collection of previousl...
Many real world problems can be expressed as optimisation problems. Solving such problems means to f...
Discrete optimization problems are usually NP hard. When choosing or designing an algorithm for solv...
We describe a framework, implemented in CAB-INS, for iterative schedule revision based on acqui-siti...
AbstractPractical scheduling problems generally require allocation of resources in the presence of a...
The utility problem in learning systems occurs when knowledge learned in an attempt to improve a sys...
The knowledge stored in a case base is central to the problem solving of a case-based reasoning (CBR...
Case Based Reasoning (CBR) is an intelligent systems methodology that enables information managers t...
This paper presents a general learning method for dynamically selecting between repair heuristics in...
In this paper we present a Self-Optimizing module, inspired on Autonomic Computing, acquiring a sc...
computational analysis of these factors. We use this method to analyze different types of problem so...
Knowledge maintenance for Case-Based Reasoning systems is an important knowledge engineering task de...
Knowledge refinement tools seek to correct faulty rule-based systems by identifying and repairing fa...
Many real world problems can be expressed as optimisation problems. Solving this kind of problems me...
The inability of a problem solver to produce solutions of a desired quality often may lie in the inc...
Case-based reasoning (CBR) infers a solution to a new problem by searching a collection of previousl...
Many real world problems can be expressed as optimisation problems. Solving such problems means to f...
Discrete optimization problems are usually NP hard. When choosing or designing an algorithm for solv...