4843 search results - page 244 / 969 » The Shortcut Problem - Complexity and Approximation |
221
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
129
Voted
SSS
2009
Springer
15 years 10 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
191
Voted
ESANN
2000
15 years 5 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
121
click to vote
ICML
1999
IEEE
16 years 4 months ago
1999
IEEE
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
127
click to vote
ICML
1995
IEEE
16 years 4 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...