202 search results - page 22 / 41 » Complexity of local search for the p-median problem |
CP
2004
Springer
14 years 24 days ago
2004
Springer
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
EAAI
2007
13 years 7 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
BMCBI
2010
13 years 7 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...