269 search results - page 53 / 54 » random 2001 |
ICALP
2001
Springer
13 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
IWLCS
2001
Springer
13 years 10 months ago
2001
Springer
In previous papers we have described the basic elements for building an economic model consisting of a group of artificial traders functioning and adapting in an environment conta...
NLPRS
2001
Springer
13 years 10 months ago
2001
Springer
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
WSC
2001
13 years 7 months ago
2001
This paper investigates the dimensionality characteristics of the outcome space of a combat simulation. The independent state variables of all of the outcome states for a simulati...
WSC
2001
13 years 7 months ago
2001
Variance is a classical measure of a point estimator's sampling error. In steady-state simulation experiments, many estimators of this variance--or its square root, the stand...