1809 search results - page 357 / 362 » Weakly Computable Real Numbers |
COR
2000
13 years 7 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
ML
2000
ACM
13 years 7 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
NN
2000
Springer
13 years 7 months ago
2000
Springer
The proper functioning of the nervous system depends critically on the intricate network of synaptic connections that are generated during the system development. During the netwo...
INFORMS
1998
13 years 7 months ago
1998
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...