1941 search results - page 26 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
WASA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
SPAA
2004
ACM
14 years 25 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
SIROCCO
2008
13 years 8 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
When a considerable number of mutations have no effects on fitness values, the fitness landscape is said neutral. In order to study the interplay between neutrality, which exists ...