201 search results - page 29 / 41 » Incremental Algorithms for Approximate Compilation |
152
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
159
click to vote
IJCAI
2007
15 years 7 months ago
2007
Planning in partially-observable dynamical systems (such as POMDPs and PSRs) is a computationally challenging task. Popular approximation techniques that have proved successful ar...
174
click to vote
NIPS
2007
15 years 7 months ago
2007
Stability is a desirable characteristic for linear dynamical systems, but it is often ignored by algorithms that learn these systems from data. We propose a novel method for learn...
171
click to vote
CP
2009
Springer
16 years 19 days ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
189
click to vote
JAIR
2010
15 years 20 days ago
2010
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...