15485 search results - page 571 / 3097 » Computing Optimal Subsets |
209
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
163
click to vote
CAD
2002
Springer
15 years 7 months ago
2002
Springer
This paper discusses product variety design under optimization viewpoint. Product variety design means the challenge to simultaneously design multiple products toward higher optim...
198
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...
179
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
169
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
This paper studies the problem of e ciently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of sche...