4843 search results - page 463 / 969 » The Shortcut Problem - Complexity and Approximation |
168
click to vote
GECCO
2006
Springer
15 years 8 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...
162
click to vote
ESA
2000
Springer
15 years 8 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...
163
click to vote
CDC
2009
IEEE
15 years 8 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 ...
145
click to vote
AAIM
2005
Springer
15 years 7 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...
137
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...