Sciweavers

2490 search results - page 249 / 498
» Complexity of Contextual Reasoning
Sort
View
EWCBR
2006
Springer
15 years 10 months ago
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
Kalyan Moy Gupta, David W. Aha, Philip Moore
ICCBR
1995
Springer
15 years 9 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
ICSE
1995
IEEE-ACM
15 years 9 months ago
Reverse Engineering of Legacy Code Exposed
— Reverse engineering of large legacy software systems generally cannot meet its objectives because it cannot be cost-effective. There are two main reasons for this. First, it is...
Bruce W. Weide, Wayne D. Heym, Joseph E. Hollingsw...
LICS
1989
IEEE
15 years 9 months ago
Elf: A Language for Logic Definition and Verified Metaprogramming
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
Frank Pfenning
DLOG
2007
15 years 8 months ago
Action Based ABox Update: an Example from the Chemical Compound Formulation
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
Alessandro Mosca, Matteo Palmonari