: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
We propose in this paper a general framework for integrating inductive and case-based reasoning (CBR) techniques for diagnosis tasks. We present a set of practical integrated appro...
Eric Auriol, Michel Manago, Klaus-Dieter Althoff, ...
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...