895 search results - page 160 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
EC
2010
13 years 8 months ago
2010
Perhaps the biggest limitation of interactive EC is the fitness evaluation bottleneck, caused by slow user evaluation and leading to small populations and user fatigue. In this st...
WWW
2001
ACM
14 years 9 months ago
2001
ACM
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
LPNMR
2009
Springer
14 years 3 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...