4208 search results - page 230 / 842 » Better Selection of the Best |
165
click to vote
WEA
2007
Springer
16 years 20 days ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
162
click to vote
ICCNMC
2005
Springer
16 years 2 days ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
199
click to vote
ICNC
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Different mutation operators have been proposed in evolutionary programming. However, each operator may be efficient in solving a subset of problems, but will fail in an...
158
click to vote
PREMI
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We develop a framework for parallel computation of the optimal rough set decision reducts from data. We adapt the island model for evolutionary computing. The idea is to ...
156
click to vote
SAT
2005
Springer
16 years 1 days ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...