1242 search results - page 147 / 249 » A Computational Complexity Theory in Membrane Computing |
163
Voted
GECCO
2007
Springer
16 years 6 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
147
click to vote
POLICY
2007
Springer
16 years 5 days ago
2007
Springer
The richness of today’s electronic communications mirrors physical world: activities such as shopping, business and scientific collaboration are conducted online. Current intera...
173
click to vote
P2P
2005
IEEE
15 years 11 months ago
2005
IEEE
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
149
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
187
click to vote
SIGECOM
2003
ACM
15 years 11 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...