Sciweavers

14386 search results - page 132 / 2878
» The Chinese Generals Problem
Sort
View
NECO
2010
97views more  NECO 2010»
15 years 2 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
120
Voted
FOCS
2006
IEEE
15 years 9 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
120
Voted
SCL
2008
96views more  SCL 2008»
15 years 3 months ago
Min-Max MPC based on a network problem
In general, min
Teodoro Alamo, David Muñoz de la Peñ...
104
Voted
GEOINFORMATICA
2002
84views more  GEOINFORMATICA 2002»
15 years 3 months ago
Simultaneous Graphic Generalization of Vector Data Sets
Manual cartographic generalization is a simultaneous process. However, most automatic approaches so far have been sequential; generalization operators are applied one at a time in...
Lars Harrie, Tapani Sarjakoski
135
Voted
CLA
2007
15 years 5 months ago
Policies Generalization in Reinforcement Learning using Galois Partitions Lattices
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a se...
Marc Ricordeau, Michel Liquiere