1060 search results - page 137 / 212 » On the Discovery of Random Trees |
202
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
148
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
139
click to vote
ICIP
2006
IEEE
16 years 9 days ago
2006
IEEE
We propose in this paper a new formulation of the equation of the optical flow enabling to compute global and local motions of multi-structure objects (flowers and petals, trees...
160
click to vote
SDMW
2004
Springer
15 years 11 months ago
2004
Springer
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the...
182
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...