11211 search results - page 1805 / 2243 » Data Structures |
175
click to vote
IJCAI
1993
15 years 8 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
145
Voted
LFP
1994
15 years 8 months ago
1994
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
201
click to vote
OSDI
1994
ACM
15 years 8 months ago
1994
ACM
We describe the lockingarchitecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel lockingtechni...
232
Voted
IJCAI
1989
15 years 8 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
209
Voted
SODA
1990
ACM
15 years 8 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...