1263 search results - page 113 / 253 » A* with Bounded Costs |
184
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
179
click to vote
IPPS
2009
IEEE
16 years 29 days ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
187
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
164
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
138
click to vote
ICDT
1999
ACM
15 years 10 months ago
1999
ACM
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...