Sciweavers

55 search results - page 5 / 11
» Local and Global Complete Solution Learning Methods for QBF
Sort
View
ICRA
2010
IEEE
143views Robotics» more  ICRA 2010»
13 years 6 months ago
Apprenticeship learning via soft local homomorphisms
Abstract— We consider the problem of apprenticeship learning when the expert’s demonstration covers only a small part of a large state space. Inverse Reinforcement Learning (IR...
Abdeslam Boularias, Brahim Chaib-draa
ATAL
2011
Springer
12 years 7 months ago
Decomposing constraint systems: equivalences and computational properties
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
Wiebe van der Hoek, Cees Witteveen, Michael Wooldr...
JMLR
2010
367views more  JMLR 2010»
13 years 2 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 1 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
TSMC
1998
169views more  TSMC 1998»
13 years 7 months ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...