511 search results - page 81 / 103 » Using Combinatorial Optimization Methods for Quantification ... |
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
136
click to vote
FOGA
2011
14 years 1 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
EVOW
2000
Springer
15 years 1 months ago
2000
Springer
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
109
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...