66 search results - page 4 / 14 » Worst Cases of a Periodic Function for Large Arguments |
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
Some classes of real-time systems function in environments which cannot be modeled with static approaches. In such environments, the arrival rates of events which drive transient ...
FCS
2006
13 years 9 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
MASCOTS
2001
13 years 9 months ago
2001
Farsite is a scalable, distributed file system that logically functions as a centralized file server but that is physically implemented on a set of client desktop computers. Farsi...
MCS
2011
Springer
13 years 2 months ago
2011
Springer
Consider a matrix valued function A(x) ∈ Rm×n , m ≥ n, smoothly depending on parameters x ∈ Ω ⊂ R2 , where Ω is simply connected and bounded. We consider a technique t...
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...