Sciweavers

21324 search results - page 183 / 4265
» Making the case for computing
Sort
View
145
Voted
EWCBR
2008
Springer
15 years 5 months ago
Forgetting Reinforced Cases
To meet time constraints, a CBR system must control the time spent searching in the case base for a solution. In this paper, we presents the results of a case study comparing the p...
Houcine Romdhane, Luc Lamontagne
131
Voted
FOCS
1990
IEEE
15 years 7 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet
SASO
2007
IEEE
15 years 9 months ago
Self-organizing Replica Placement - A Case Study on Emergence
The concept of self-organization is rapidly gaining importance in the area of distributed computing systems. However, we still lack the necessary means for engineering such system...
Klaus Herrmann
SAINT
2005
IEEE
15 years 9 months ago
A Case Study in Running a Parallel Branch and Bound Application on the Grid
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...
Kento Aida, Tomotaka Osumi