602 search results - page 49 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
86
Voted
IWANN
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The aim of this paper is to present a new tool of multiple instance learning which is designed using a grammar based genetic programming (GGP) algorithm. We study its app...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Page-based Linear Genetic Programming (GP) is proposed and implemented with two-layer Subset Selection to address a two-class intrusion detection classification problem a...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
EVOW
2005
Springer
15 years 3 months ago
2005
Springer
Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in ord...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we consider the problem of describing the action being performed by human figures in still images. We will attack this problem using an unsupervised learning approac...