697 search results - page 75 / 140 » On the Theory of Average Case Complexity |
AAAI
2004
13 years 9 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
ECIS
2003
13 years 9 months ago
2003
The academic literature relating to the political issues of information systems is fairly well established. However, there are relatively few empirical studies relating to the pol...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
COMPUTING
2008
13 years 8 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
SIAMCOMP
2002
13 years 7 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...