4894 search results - page 145 / 979 » The Guarding Problem - Complexity and Approximation |
187
click to vote
COCOON
2010
Springer
15 years 10 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
186
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
158
click to vote
CEC
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract— This paper presents a new efficient multiobjective evolutionary algorithm for solving computationallyintensive optimization problems. To support a high degree of parall...
189
click to vote
MCS
2010
Springer
15 years 4 months ago
2010
Springer
Some aspects of goal-oriented a posteriori error estimation are addressed in the context of steady convection-diffusion equations. The difference between the exact and approxima...
163
click to vote
PARMA
2004
15 years 7 months ago
2004
The purpose of this paper is to study the problem of pattern classification as this is presented in the context of data mining. Among the various approaches we focus on the use of ...