10271 search results - page 1715 / 2055 » Computer Science |
193
click to vote
MFCS
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
172
click to vote
MFCS
2004
Springer
16 years 1 days 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...
148
click to vote
MFCS
2004
Springer
16 years 1 days 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...
160
click to vote
MFCS
2004
Springer
16 years 1 days 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 ...
178
click to vote
MFCS
2004
Springer
16 years 1 days 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...