3096 search results - page 281 / 620 » Theory and Use of the EM Algorithm |
160
click to vote
FSEN
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...
133
click to vote
ICRA
2005
IEEE
16 years 6 days ago
2005
IEEE
– This paper describes a new algorithm for the efficient mass-matrix inversion of serial manipulators. Whereas several well-known O(n) algorithms already exist, our presentation ...
181
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
195
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
190
click to vote
JACM
2010
15 years 5 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...