706 search results - page 24 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
INFOCOM
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract- This paper describes an algorithm for optimally placing a given number of wavelength converters in All-Optical Networks(A0Ns) with arbitrary topologies. We first introduc...
SWAT
2004
Springer
14 years 28 days ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
DAM
2008
13 years 7 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
INFORMATICALT
2006
13 years 7 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
ICITA
2005
IEEE
14 years 1 months ago
2005
IEEE
Small-sample learning in image retrieval is a pertinent and interesting problem. Relevance feedback is an active area of research that seeks to find algorithms that are robust wi...