1279 search results - page 212 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
CAV
2001
Springer
14 years 1 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...
EMMCVPR
1997
Springer
14 years 29 days 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 ...
ATAL
2007
Springer
14 years 25 days 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...
ECAI
2006
Springer
14 years 15 days 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 ...
SIGMOD
2009
ACM
14 years 9 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...