10493 search results - page 264 / 2099 » Dynamic Word Problems |
92
Voted
ICGA
1993
15 years 3 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 ...
91
Voted
DLOG
2008
15 years 4 months ago
2008
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
108
click to vote
IROS
2006
IEEE
15 years 8 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...
ESA
2009
Springer
15 years 9 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...
120
click to vote
WAPCV
2007
Springer
15 years 8 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...