Sciweavers

2905 search results - page 134 / 581
» Formal Memetic Algorithms
Sort
View
TAPSOFT
1997
Springer
14 years 2 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez
CEC
2009
IEEE
14 years 4 months ago
Inertial geometric particle swarm optimization
— Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of a simplified form of traditional particle swarm optimization (PSO) without the i...
Alberto Moraglio, Julian Togelius
FMICS
2009
Springer
14 years 4 months ago
Dynamic State Space Partitioning for External Memory Model Checking
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checki...
Sami Evangelista, Lars Michael Kristensen
SYNASC
2007
IEEE
134views Algorithms» more  SYNASC 2007»
14 years 4 months ago
Building Agent-Based Simulations Using Structural and Process Mental Models
This paper provides a design rationale for a mechanism that enforces a correct mapping between a model of a nested agent organization and a model of a composite interaction-based ...
Marco Stuit, Nick B. Szirbik, Hans Wortmann
MFCS
2007
Springer
14 years 4 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten