11 search results - page 2 / 3 » The Computational Complexity of Orientation Search Problems ... |
PPSN
2004
Springer
14 years 1 months 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...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
CCGRID
2007
IEEE
14 years 15 days ago
2007
IEEE
We describe a hybrid linear programming (LP) and evolutionary algorithm (EA) based resource matcher suitable for heterogeneous grid environments. The hybrid matcher adopts the ite...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...