3008 search results - page 427 / 602 » Independence in connected graphs |
202
click to vote
ICCS
2004
Springer
16 years 10 days ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
182
click to vote
ICCSA
2004
Springer
16 years 10 days ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
166
click to vote
PPSN
2004
Springer
16 years 9 days ago
2004
Springer
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
174
click to vote
IPPS
2003
IEEE
16 years 7 days ago
2003
IEEE
Kahn defined a formal model for networks of processes that communicate through channels carrying streams of data tokens. His mathematical results show the necessary conditions fo...
194
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...