10493 search results - page 67 / 2099 » Dynamic Word Problems |
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
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ļ¬...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithmās overall performance. These metrics show whether one algorithm is better than another, but...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
ā Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem speciļ¬cations, con...