16404 search results - page 461 / 3281 » A set coverage problem |
176
click to vote
COMPGEOM
2004
ACM
16 years 7 days ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
155
click to vote
GECCO
2004
Springer
16 years 5 days ago
2004
Springer
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
151
click to vote
IWPEC
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
192
click to vote
PPSN
2004
Springer
16 years 4 days ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
168
click to vote
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...