5183 search results - page 319 / 1037 » The Complexity of Distributions |
131
click to vote
PPSN
2004
Springer
16 years 16 hour ago
2004
Springer
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
171
click to vote
PPSN
2004
Springer
16 years 16 hour ago
2004
Springer
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
178
click to vote
PPAM
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
188
click to vote
ECAL
1999
Springer
15 years 11 months ago
1999
Springer
We report on a case study in the emergence of a lexicon in a group of autonomous distributed agents situated and grounded in an open environment. Because the agents are autonomous,...
163
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...