41 search results - page 4 / 9 » isaac 2003 |
162
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
152
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
123
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
153
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
141
click to vote
ISAAC
2003
Springer
15 years 10 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...