7129 search results - page 439 / 1426 » Approximation Algorithms for Treewidth |
170
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
193
click to vote
ICRA
2008
IEEE
16 years 23 days ago
2008
IEEE
— The lack of a parameterized observation model in robot localization using occupancy grids requires the application of sampling-based methods, or particle filters. This work ad...
155
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
178
click to vote
IJCAI
2007
15 years 7 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
205
click to vote
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...