8540 search results - page 242 / 1708 » The Dynamic Servers Problem |
157
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
We present a novel algorithm for optimally segmenting dynamic scenes containing multiple rigidly moving objects. We cast the motion segmentation problem as a constrained nonlinear...
102
Voted
ICGA
1993
15 years 4 months ago
1993
In this paper, we present e cient algorithms for adjusting con guration parameters of genetic algorithms that operate in a noisy environment. Assuming that the population size is ...
116
click to vote
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
103
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
135
click to vote
WAPCV
2007
Springer
15 years 9 months ago
2007
Springer
We present a biologically plausible computational model for solving the visual feature binding problem. The binding problem appears to be due to the distributed nature of visual pr...