1578 search results - page 18 / 316 » Direct Routing: Algorithms and Complexity |
MOR
2002
13 years 8 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In order to overcome the low convergence speed and prematurity of classical genetic algorithm, an improved method named directional self-learning of genetic algorithm (DSLGA) is p...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
ITCC
2005
IEEE
14 years 2 months ago
2005
IEEE
has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the informatio...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...