11345 search results - page 2021 / 2269 » Foundations of Computer Science |
135
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
102
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
121
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
124
click to vote
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
114
click to vote
OOPSLA
2004
Springer
15 years 8 months ago
2004
Springer
These notes have the status of letters written to ourselves: we wrote them down because, without doing so, we found ourselves making rguments over and over again. So began the abs...