903 search results - page 51 / 181 » Non-well-founded trees in categories |
123
click to vote
ISPD
2010
ACM
15 years 8 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
113
click to vote
VRST
2009
ACM
15 years 8 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
132
click to vote
CODES
2006
IEEE
15 years 8 months ago
2006
IEEE
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
134
click to vote
SAC
2006
ACM
15 years 8 months ago
2006
ACM
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
112
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...