4894 search results - page 542 / 979 » The Guarding Problem - Complexity and Approximation |
136
click to vote
GPEM
2006
15 years 4 months ago
2006
A novel method for solving ordinary and partial differential equations, based on grammatical evolution is presented. The method forms generations of trial solutions expressed in an...
154
click to vote
NA
2008
15 years 4 months ago
2008
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
137
click to vote
QUESTA
2006
15 years 4 months ago
2006
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute t...
134
click to vote
JVCIR
2007
15 years 4 months ago
2007
This paper proposes a natural and efficient way to achieve staircase reduction in texture extraction models of image processing. Moreover, we propose a precise framework for this ...
122
Voted
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...