2233 search results - page 147 / 447 » On the Complexity of Theory Curbing |
163
click to vote
GECCO
2009
Springer
16 years 29 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
153
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
217
click to vote
AIR
2006
15 years 6 months ago
2006
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...
175
click to vote
ALT
2007
Springer
16 years 18 days ago
2007
Springer
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
183
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...