Sciweavers

738 search results - page 23 / 148
» cases 2001
Sort
View
STOC
2001
ACM
143views Algorithms» more  STOC 2001»
14 years 10 months ago
Computing crossing numbers in quadratic time
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
Martin Grohe
ICCBR
2001
Springer
14 years 2 months ago
Mining High-Quality Cases for Hypertext Prediction and Prefetching
Case-based reasoning aims to use past experience to solve new problems. A strong requirement for its application is that extensive experience base exists that provides statisticall...
Qiang Yang, Ian Tian Yi Li, Henry Haining Zhang
ICCBR
2001
Springer
14 years 2 months ago
Case-Based Reasoning in the Care of Alzheimer's Disease Patients
Abstract. Planning the ongoing care of Alzheimer's Disease (AD) patients is a complex task, marked by cases that change over time, multiple perspectives, and ethical issues. G...
Cynthia R. Marling, Peter Whitehouse
ICCBR
2001
Springer
14 years 2 months ago
Meta-case-Based Reasoning: Using Functional Models to Adapt Case-Based Agents
It is useful for an intelligent software agent to be able to adapt to new demands from an environment. Such adaptation can be viewed as a redesign problem; an agent has some origin...
J. William Murdock, Ashok K. Goel
SOFSEM
2009
Springer
14 years 6 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach