Sciweavers

99 search results - page 10 / 20
» Dynamic Co-operative Intelligent Memory
Sort
View
SARA
2005
Springer
14 years 29 days ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler
CEC
2010
IEEE
13 years 8 months ago
Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search
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 ...
Shi-Zheng Zhao, Ponnuthurai Nagaratnam Suganthan, ...
KESAMSTA
2010
Springer
13 years 9 months ago
Modelling Dynamic Forgetting in Distributed Information Systems
Abstract. We describe and model a new aspect in the design of distributed information systems. We build upon a previously described problem on the microlevel, which asks how quickl...
Nicolas Höning, Martijn C. Schut
AUSAI
2003
Springer
14 years 21 days ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
FLAIRS
2004
13 years 9 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar