4894 search results - page 474 / 979 » The Guarding Problem - Complexity and Approximation |
156
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
182
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
177
click to vote
ESA
2000
Springer
15 years 9 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
170
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
160
click to vote
AAIM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...