pith. sign in

Title resolution pending

=− 1√ 2·min(mc, 1 D(1− ε)· d(˜a,r′)), hence ∆ψ≤ √ 24D ε ∑k i=1d(ci,c′ i)− 4D ε ·min(mc, 1 D(1−ε)·d(˜a,r′))−D·∑k i=2d(ai,a′ i)

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Managing Multiple Mobile Resources

cs.DS · 2019-07-23 · unverdicted · novelty 6.0

Proves impossibility of constant competitiveness for k-mobile servers without request locality, gives constant lower bounds with locality, and presents a polynomial-competitive algorithm via simulation of k-page migration plus greedy moves under augmentation and locality.

citing papers explorer

Showing 1 of 1 citing paper.

  • Managing Multiple Mobile Resources cs.DS · 2019-07-23 · unverdicted · none · ref 23

    Proves impossibility of constant competitiveness for k-mobile servers without request locality, gives constant lower bounds with locality, and presents a polynomial-competitive algorithm via simulation of k-page migration plus greedy moves under augmentation and locality.