654 search results - page 113 / 131 » On the Approximation of Computing Evolutionary Trees |
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
117
click to vote
SDM
2012
SIAM
13 years 2 days ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
102
click to vote
GECCO
1999
Springer
15 years 1 months ago
1999
Springer
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
PODS
2007
ACM
15 years 9 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...