365 search results - page 11 / 73 » Solving the Multiplication Constraint in Several Approximati... |
STAIRS
2008
13 years 9 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
AI
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
AI
2004
Springer
14 years 1 months ago
2004
Springer
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
IJCV
1998
13 years 7 months ago
1998
We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence...
WCE
2007
13 years 8 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...