2168 search results - page 67 / 434 » Randomized Algorithms and Complexity Theory |
189
Voted
CCECE
2006
IEEE
16 years 5 days ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
281
Voted
ICAART
2010
INSTICC
16 years 3 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
156
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
218
click to vote
JDCTA
2010
15 years 27 days ago
2010
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
171
Voted
ISSAC
2007
Springer
16 years 7 days ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...