6719 search results - page 71 / 1344 » A Generalization of Automatic Sequences |
MA
2011
Springer
13 years 3 months ago
2011
Springer
Let S be a p × p random matrix having a Wishart distribution Wp(n, n−1Σ). For testing a general covariance structure Σ = Σ(ξ), we consider a class of test statistics Th = n...
ICFEM
2004
Springer
14 years 2 months ago
2004
Springer
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...
ADBIS
2000
Springer
14 years 1 months ago
2000
Springer
Conducting data mining on logs of web servers involves the determination of frequently occurring access sequences. We examine the problem of finding traversal patterns from web lo...
WSC
1998
13 years 10 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
IJBC
2006
13 years 8 months ago
2006
In this paper a three-parameter bifurcation analysis of a piecewise-affine map is carried out. Such a map derives from a well-known map which has good features from its circuit im...