1254 search results - page 76 / 251 » Making Hard Problems Harder |
SOSP
2005
ACM
14 years 5 months ago
2005
ACM
We present a method for automatically extracting from a running system an indexable signature that distills the essential characteristic from a system state and that can be subjec...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
ATAL
2003
Springer
14 years 2 months ago
2003
Springer
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
GECCO
2006
Springer
14 years 20 days ago
2006
Springer
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
CIVR
2007
Springer
14 years 3 months ago
2007
Springer
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...