7129 search results - page 984 / 1426 » Approximation Algorithms for Treewidth |
121
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
130
click to vote
IMR
2004
Springer
15 years 10 months ago
2004
Springer
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
132
click to vote
PERVASIVE
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Location-awareness is useful for mobile and pervasive computing. We present a novel adaptive framework for recognizing personally important locations in cellular networks...
115
click to vote
PVM
2004
Springer
15 years 10 months ago
2004
Springer
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
149
click to vote
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...