8016 search results - page 1359 / 1604 » On the practical genetic algorithms |
154
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
181
click to vote
DAGM
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
156
click to vote
DSVIS
2005
Springer
16 years 2 days ago
2005
Springer
The design and construction of navigation menus for websites have traditionally been performed manually according to the intuition of a web developer. This paper introduces a new a...
165
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
The iterated prisoner’s dilemma is a widely used computational model of cooperation and conflict. Many studies report emergent cooperation in populations of agents trained to p...
164
click to vote
ICLP
2005
Springer
16 years 1 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...