1554 search results - page 123 / 311 » Parameterized Complexity and Approximation Algorithms |
137
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
123
Voted
WINE
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
180
Voted
COMGEO
2002
ACM
15 years 3 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
119
Voted
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
We propose a real-time method for rendering rigid objects with complex view-dependent effects under distant all-frequency lighting. Existing precomputed light transport approaches...
216
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...