269 search results - page 40 / 54 » Online oblivious routing |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
ICISC
2008
13 years 10 months ago
2008
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
NETCOOP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without ...
ISPAN
2008
IEEE
14 years 3 months ago
2008
IEEE
Massively Multiuser Online Game, i.e. MMOG, is an active research especially to integrate players to perform routing task with the intention of keeping the game deployment cost to...