994 search results - page 19 / 199 » Custom Computing Machines for the Set Covering Problem |
COMPGEOM
2006
ACM
14 years 1 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...
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...
BIRTHDAY
1997
Springer
13 years 12 months ago
1997
Springer
This article describes a parallel and distributed machine learning approach to a basic variant of the job assignment problem. The approach is in the line of the multiagent learning...
ICAS
2006
IEEE
14 years 1 months ago
2006
IEEE
A modern server system must deliver a complex set of obligations towards its users. We study the concept of roles as autonomous encapsulations of a set of promises. Using virtuali...