Sciweavers

1199 search results - page 190 / 240
» Graph Theory
Sort
View
FOCS
1997
IEEE
15 years 4 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
GRAPHITE
2007
ACM
15 years 3 months ago
Anna Ursyn
This review tells about the International Conference on Information Visualization that is held annually in London, England. Themes selected from the Conference Proceedings are foc...
Anna Ursyn
OPODIS
2008
15 years 1 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
ISMB
1993
15 years 1 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 28 days ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen