Sciweavers

3758 search results - page 76 / 752
» A Complete Subsumption Algorithm
Sort
View
SPDP
1991
IEEE
14 years 1 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
CLA
2006
13 years 11 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
JAIR
2006
131views more  JAIR 2006»
13 years 9 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
14 years 4 months ago
A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
AAAI
2006
13 years 11 months ago
A Two-Step Hierarchical Algorithm for Model-Based Diagnosis
For many large systems the computational complexity of complete model-based diagnosis is prohibitive. In this paper we investigate the speedup of the diagnosis process by exploiti...
Alexander Feldman, Arjan J. C. van Gemund