16404 search results - page 418 / 3281 » A set coverage problem |
145
Voted
WETICE
2006
IEEE
16 years 22 days ago
2006
IEEE
The problem of removing sensitive information from data before it is released publicly, or turned over to less trusted analysts, underlies much of the unwillingness to share data....
154
click to vote
CP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
153
click to vote
GECCO
2005
Springer
16 years 8 days ago
2005
Springer
In this paper the potential of GP-generated symbolic regression for alleviating multicollinearity problems in multiple regression is presented with a case study in an industrial s...
170
click to vote
ICNC
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
252
click to vote
ICAISC
2004
Springer
16 years 3 days ago
2004
Springer
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...