1161 search results - page 55 / 233 » Approximation schemes for clustering problems |
AICCSA
2001
IEEE
15 years 1 months ago
2001
IEEE
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
UAI
2004
14 years 11 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
ML
2012
ACM
13 years 5 months ago
2012
ACM
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
102
click to vote
ACTA
2005
14 years 9 months ago
2005
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
FCT
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...