Sciweavers

11328 search results - page 1845 / 2266
» Timed Branching Processes
Sort
View
ICCBR
1995
Springer
15 years 8 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
174
Voted
IPPS
1997
IEEE
15 years 8 months ago
View Caching: Efficient Software Shared Memory for Dynamic Computations
Software distributed shared memory (DSM) techniques, while effective on applications with coarse-grained sharing, yield poor performance for the fine-grained sharing encountered i...
Vijay Karamcheti, Andrew A. Chien
KDD
1997
ACM
154views Data Mining» more  KDD 1997»
15 years 8 months ago
Autonomous Discovery of Reliable Exception Rules
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
Einoshin Suzuki
KDD
1995
ACM
108views Data Mining» more  KDD 1995»
15 years 8 months ago
A Statistical Perspective On Knowledge Discovery In Databases
The quest to nd models usefully characterizing data is a process central to the scienti c method, and has been carried out on many fronts. Researchers from an expanding number of ...
John F. Elder IV, Daryl Pregibon
SIGMETRICS
1991
ACM
15 years 8 months ago
Implementing Stack Simulation for Highly-Associative Memories
Prior to this work, all implementations of stack simulation [MGS70] required more than linear time to process an address trace. In particular these implementations are often slow ...
Yul H. Kim, Mark D. Hill, David A. Wood
« Prev « First page 1845 / 2266 Last » Next »