Sciweavers

9842 search results - page 280 / 1969
» Problem complexity
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
15 years 6 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
TEC
2002
183views more  TEC 2002»
15 years 6 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
SAGT
2010
Springer
181views Game Theory» more  SAGT 2010»
15 years 5 months ago
On the Complexity of Pareto-optimal Nash and Strong Equilibria
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
Martin Hoefer, Alexander Skopalik
CGF
2010
167views more  CGF 2010»
15 years 4 months ago
Chain Shape Matching for Simulating Complex Hairstyles
Animations of hair dynamics greatly enrich the visual attractiveness of human characters. Traditional simulation techniques handle hair as clumps or continuum for efficiency; howe...
Witawat Rungjiratananon, Yoshihiro Kanamori, Tomoy...
JAIR
2011
123views more  JAIR 2011»
15 years 1 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...