多山
发表于 2025-3-28 17:00:46
Cooperation and Self-organized Criticality for Studying Economic Crises,vestigated and the solutions that can prevent these phenomena are searched for. A new economic model inspired by the . based on a connective structure is introduced. Interesting complex behaviour emerges from the simple interactions between the agents. A new, unconventional, cause for economic crises is identified and described.
CAPE
发表于 2025-3-28 21:01:40
http://reply.papertrans.cn/67/6621/662006/662006_42.png
受伤
发表于 2025-3-29 02:06:33
http://reply.papertrans.cn/67/6621/662006/662006_43.png
thalamus
发表于 2025-3-29 03:59:06
Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem, to/from) by means of the available quay cranes at a container terminal. The experimental results confirm that such algorithms are suitable for solving the QCSP and perform a wide exploration of the solution space using reduced computational times.
gout109
发表于 2025-3-29 07:49:21
Enhancing the Computational Mechanics of Cellular Automata,st widely studied cellular automata computation problem, the Density Classification Task, where incorporation of the proposed method almost always pushes the search beyond the simple block-expanding rules.
lavish
发表于 2025-3-29 12:44:01
http://reply.papertrans.cn/67/6621/662006/662006_46.png
使高兴
发表于 2025-3-29 17:40:56
An Adaptive Multiagent Strategy for Solving Combinatorial Dynamic Optimization Problems, in order to obtain a more robust behaviour. The adaptive scheme is also tested on an evolutionary algorithm (EA). Finally, both Agents and EA are compared against the recent state of the art adaptive hill-climbing memetic algorithm (AHMA).
N斯巴达人
发表于 2025-3-29 22:56:17
http://reply.papertrans.cn/67/6621/662006/662006_48.png
Obstreperous
发表于 2025-3-30 01:23:09
http://reply.papertrans.cn/67/6621/662006/662006_49.png
羽饰
发表于 2025-3-30 05:32:14
Gravitational Swarm Approach for Graph Coloring, move as particles in the gravitational field defined by some target objects corresponding to graph node colors. Knowledge of the graph to be colored is encoded in the agents as friend-or-foe information. We discuss the convergence of the algorithm and test it over well-known benchmarking graphs, achieving good results in a reasonable time.