15485 search results - page 2615 / 3097 » Computing Optimal Subsets |
187
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
190
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
213
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
234
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
207
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...