246 search results - page 18 / 50 » Dynamic Local Search for the Maximum Clique Problem |
174
click to vote
EAAI
2007
15 years 5 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�...
193
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
148
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
148
click to vote
IEAAIE
2001
Springer
15 years 10 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
163
click to vote
NIPS
1993
15 years 7 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...