2356 search results - page 407 / 472 » Characterizations of postman sets |
134
Voted
COMCOM
2004
15 years 3 months ago
2004
In a previous work we have introduced a multifractal traffic model based on so-called stochastic L-Systems, which were introduced by biologist A. Lindenmayer as a method to model ...
134
click to vote
JACM
2000
15 years 3 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
175
click to vote
LOGCOM
1998
15 years 3 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
125
Voted
SIAMCO
2002
15 years 3 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
171
click to vote
TJS
2002
15 years 3 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...