3637 search results - page 108 / 728 » On Dynamic Bit-Probe Complexity |
MMB
2001
Springer
14 years 1 months ago
2001
Springer
E-business workloads are quite complex as demonstrated by the hierarchical workload characterization discussed here. While these features may pose challenges to performance model ...
SWAT
1994
Springer
14 years 1 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
CSL
2006
Springer
13 years 9 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
IPL
2006
13 years 9 months ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
DALT
2007
Springer
14 years 3 months ago
2007
Springer
Agent-based modelling approaches are usually based on logical languages, whereas in many areas dynamical system models based on differential equations are used. This paper shows ho...