4524 search results - page 126 / 905 » The Complexity of Global Constraints |
84
Voted
ICRA
2009
IEEE
15 years 7 months 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...
104
Voted
COREGRID
2007
Springer
15 years 6 months ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
103
Voted
ICLP
2005
Springer
15 years 6 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...
123
Voted
CPAIOR
2006
Springer
15 years 4 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...
138
Voted
TNN
2010
14 years 7 months 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...