5595 search results - page 1040 / 1119 » Approximation Algorithms for Clustering Problems |
133
click to vote
ECML
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Learning to act in an unknown partially observable domain is a difficult variant of the reinforcement learning paradigm. Research in the area has focused on model-free m...
141
Voted
ARCS
2004
Springer
15 years 10 months ago
2004
Springer
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
120
click to vote
CAAN
2004
Springer
15 years 10 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
129
click to vote
CGI
2003
IEEE
15 years 10 months ago
2003
IEEE
In contrast to the extensively researched modeling of plant architecture, the modeling of plant organs largely remains an open problem. In this paper, we propose a method for mode...
164
click to vote
ICCV
2003
IEEE
15 years 10 months ago
2003
IEEE
Many of the computer vision algorithms have been posed in various forms of differential equations, derived from minimization of specific energy functionals, and the finite eleme...