1054 search results - page 102 / 211 » Capacitated Domination Problem |
120
click to vote
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
The application of semi-supervised learning algorithms to large scale vision problems suffers from the bad scaling behavior of most methods. Based on the Expectation Regularization...
120
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
119
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
100
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
For problems where the evaluation of an individual is the dominant factor in the total computation time of the evolutionary process, minimizing the number of evaluations becomes cr...