648 search results - page 79 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
131
click to vote
SSPR
2004
Springer
15 years 6 months ago
2004
Springer
Classification fusion combines multiple classifications of data into a single classification solution of greater accuracy. Feature extraction aims to reduce the computational cost ...
101
click to vote
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
123
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
105
Voted
COMPSEC
2010
14 years 11 months ago
2010
In this paper we address the problem of reducing the role mining complexity in RBAC systems. To this aim, we propose a three steps methodology: first, we associate a weight to rol...
175
Voted
MFCS
2010
Springer
14 years 11 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...