Sciweavers

3643 search results - page 35 / 729
» Learning Submodular Functions
Sort
View
COCOA
2008
Springer
14 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
AI
2010
Springer
14 years 10 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
MOBIHOC
2010
ACM
14 years 8 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
ICML
2006
IEEE
15 years 10 months ago
Learning a kernel function for classification with small training samples
When given a small sample, we show that classification with SVM can be considerably enhanced by using a kernel function learned from the training data prior to discrimination. Thi...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
GECCO
2011
Springer
276views Optimization» more  GECCO 2011»
14 years 1 months ago
Evolution of reward functions for reinforcement learning
The reward functions that drive reinforcement learning systems are generally derived directly from the descriptions of the problems that the systems are being used to solve. In so...
Scott Niekum, Lee Spector, Andrew G. Barto