Sciweavers

4679 search results - page 79 / 936
» Modeling When Connections Are the Problem
Sort
View
FOCS
2005
IEEE
15 years 7 months ago
On the Complexity of Real Functions
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
Mark Braverman
GECCO
2008
Springer
324views Optimization» more  GECCO 2008»
15 years 2 months ago
Convergence behavior of the fully informed particle swarm optimization algorithm
The fully informed particle swarm optimization algorithm (FIPS) is very sensitive to changes in the population topology. The velocity update rule used in FIPS considers all the ne...
Marco Antonio Montes de Oca, Thomas Stützle
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
15 years 2 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
INFOCOM
2003
IEEE
15 years 6 months ago
Modelling the Blocking Behavior of Multicast Clos Networks
— This paper considers three-stage switching networks able to support multicast traffic, i.e. connections in which one inlet is connected to more than one output at the same tim...
Achille Pattavina, Gino L. Tesei
COCOON
2009
Springer
15 years 8 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta