1378 search results - page 88 / 276 » The Tractability of Global Constraints |
152
click to vote
ICRA
2009
IEEE
16 years 28 days ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
177
click to vote
COREGRID
2007
Springer
16 years 13 days ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
152
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
172
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
203
click to vote
TNN
2010
15 years 29 days ago
2010
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...