2168 search results - page 243 / 434 » Randomized Algorithms and Complexity Theory |
100
Voted
ICRA
2005
IEEE
15 years 9 months 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 ...
145
Voted
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
131
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
137
Voted
GECCO
2008
Springer
15 years 4 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...
150
Voted
NIPS
2007
15 years 5 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...