14548 search results - page 271 / 2910 » The Optimal Path-Matching Problem |
185
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
174
click to vote
JAT
2010
15 years 1 months ago
2010
We describe the theoretical solution of an approximation problem that uses a finite weighted sum of complex exponential functions. The problem arises in an optimization model for t...
236
click to vote
ICUIMC
2011
ACM
14 years 10 months ago
2011
ACM
Efficient and fair resource allocation associated with congestion control in multi-hop cognitive radio networks (CRN) is a challenging problem. In this paper, we consider their mu...
184
click to vote
AAAI
2011
14 years 6 months ago
2011
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
223
click to vote
JMLR
2012
13 years 9 months ago
2012
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...