Sciweavers

1026 search results - page 54 / 206
» An Optimal Solution to Room Search Problem
Sort
View
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 12 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger
ATAL
2010
Springer
15 years 28 days ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
CEC
2007
IEEE
15 years 3 months ago
Ranking-Dominance and Many-Objective Optimization
An alternative relation to Pareto-dominance is studied. The relation is based on ranking a set of solutions according to each separate objective and an aggregation function to calc...
Saku Kukkonen, Jouni Lampinen
TELSYS
2011
207views Education» more  TELSYS 2011»
14 years 6 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende
PDCN
2004
15 years 1 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...