Sciweavers

706 search results - page 79 / 142
» Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Sort
View
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
14 years 3 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...
PARELEC
2002
IEEE
14 years 1 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
JSAC
2006
115views more  JSAC 2006»
13 years 8 months ago
Deployment of an Algorithm for Large-Scale Topology Discovery
Abstract-- Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the p...
Benoit Donnet, Philippe Raoult, Timur Friedman, Ma...
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
13 years 9 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
JAL
2006
101views more  JAL 2006»
13 years 8 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...