1161 search results - page 73 / 233 » Approximation schemes for clustering problems |
RTSS
2002
IEEE
15 years 4 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
SIAMNUM
2010
14 years 6 months ago
2010
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
90
Voted
CN
2006
14 years 12 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
135
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....