Sciweavers

883 search results - page 12 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
14 years 1 months ago
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
Chu-Hsing Lin, Jui-Ling Yu, Jung-Chun Liu, Chia-Je...
JNW
2006
88views more  JNW 2006»
13 years 7 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
13 years 9 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 7 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...