3607 search results - page 529 / 722 » Learning with structured sparsity |
168
Voted
IJCAI
2003
15 years 6 months ago
2003
Information extraction can be defined as the task of automatically extracting instances of specified classes or relations from text. We consider the case of using machine learni...
152
click to vote
CEC
2010
IEEE
15 years 6 months ago
2010
IEEE
Problems in which some entities interact with each other are common in computational intelligence. This scenario, typical for co-evolving artificial-life agents, learning strategie...
140
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
173
Voted
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
159
click to vote
COR
2010
15 years 5 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...