1279 search results - page 212 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
105
click to vote
CAV
2001
Springer
15 years 6 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
121
click to vote
EMMCVPR
1997
Springer
15 years 5 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
109
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
114
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
204
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...