160 search results - page 19 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
104
click to vote
AI
1999
Springer
14 years 11 months ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
AI
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
ICDCSW
2006
IEEE
15 years 5 months ago
2006
IEEE
Subscription pruning has been proven as valuable routing optimization for Boolean subscriptions in publish/subscribe systems. It aims at optimizing subscriptions independently of ...
109
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
GECCO
2010
Springer
15 years 4 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 ...