1671 search results - page 232 / 335 » On the Covering Steiner Problem |
179
click to vote
WEBI
2001
Springer
15 years 10 months ago
2001
Springer
As meta-data become of ever more importance to the Web, we will need to start managing such meta-data. We argue that there is a strong need for meta-data validation and aggregation...
177
click to vote
OOPSLA
1997
Springer
15 years 10 months ago
1997
Springer
ed Abstract Factory is yet another. When patterns cooperate, the cooperation itself can give rise to problems, contexts, trade-offs, and consequences. For instance, should a Visito...
156
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
170
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
177
click to vote
JSA
2000
15 years 5 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...