210 search results - page 26 / 42 » Some Competition Programming Problems as the Beginning of Ar... |
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper we investigate the application of tree-adjunct grammars to grammatical evolution. The standard type of grammar used by grammatical evolution, context-free grammars, p...
INFORMS
1998
14 years 9 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
103
click to vote
EWCBR
2004
Springer
15 years 2 months ago
2004
Springer
By design, Case-Based Reasoning (CBR) systems do not need deep general knowledge. In contrast to (rule-based) expert systems, CBR systems can already be used with just some initial...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
102
click to vote
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...