Sciweavers

3038 search results - page 263 / 608
» High-Speed Function Approximation
Sort
View
COLT
2007
Springer
16 years 26 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
177
Voted
RTSS
2005
IEEE
16 years 8 days ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 10 months ago
Support vector regression for classifier prediction
In this paper we introduce XCSF with support vector prediction: the problem of learning the prediction function is solved as a support vector regression problem and each classifie...
Daniele Loiacono, Andrea Marelli, Pier Luca Lanzi
AIPS
2007
15 years 9 months ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
ICML
2010
IEEE
15 years 7 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre