Sciweavers

11565 search results - page 2107 / 2313
» Computing Minimal Mappings
Sort
View
CP
2000
Springer
15 years 9 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
159
Voted
ICCS
1997
Springer
15 years 9 months ago
Uncovering the Conceptual Models in Ripple Down Rules
: The need for analysis and modeling of knowledge has been espoused by many researchers as a prerequisite to building knowledge based systems (KBS). This approach has done little t...
Debbie Richards, Paul Compton
188
Voted
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 9 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
162
Voted
PLDI
1995
ACM
15 years 9 months ago
Corpus-Based Static Branch Prediction
Correctly predicting the direction that branches will take is increasingly important in today’s wide-issue computer architectures. The name program-based branch prediction is gi...
Brad Calder, Dirk Grunwald, Donald C. Lindsay, Jam...
ISTCS
1992
Springer
15 years 9 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
« Prev « First page 2107 / 2313 Last » Next »