5595 search results - page 871 / 1119 » Approximation Algorithms for Clustering Problems |
161
click to vote
WADS
2005
Springer
16 years 3 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
197
Voted
NOMS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
171
click to vote
PPSN
1998
Springer
15 years 10 months ago
1998
Springer
This paper presents a novel evolutionary approach of approximating the shape of the Pareto-optimal set of multi-objective optimization problems. The evolutionary algorithm (EA) use...
160
click to vote
DAS
2006
Springer
15 years 10 months ago
2006
Springer
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
175
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we deal with the sequential decision making problem of agents operating in computational economies, where there is uncertainty regarding the trustworthiness of serv...