1554 search results - page 242 / 311 » Parameterized Complexity and Approximation Algorithms |
SIAMDM
2008
14 years 11 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
TWC
2008
14 years 11 months ago
2008
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
132
click to vote
CGF
2010
14 years 8 months ago
2010
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
DAM
2011
14 years 6 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
106
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...