Sciweavers

7129 search results - page 202 / 1426
» Approximation Algorithms for Treewidth
Sort
View
MOBIHOC
2002
ACM
16 years 3 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
148
Voted
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
136
Voted
ICML
2004
IEEE
16 years 4 months ago
Convergence of synchronous reinforcement learning with linear function approximation
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
Artur Merke, Ralf Schoknecht
AAMAS
2007
Springer
15 years 10 months ago
Continuous-State Reinforcement Learning with Fuzzy Approximation
Abstract. Reinforcement learning (RL) is a widely used learning paradigm for adaptive agents. There exist several convergent and consistent RL algorithms which have been intensivel...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
129
Voted
SDM
2010
SIAM
200views Data Mining» more  SDM 2010»
15 years 5 months ago
Residual Bayesian Co-clustering for Matrix Approximation
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
Hanhuai Shan, Arindam Banerjee