Sciweavers

2905 search results - page 172 / 581
» Formal Memetic Algorithms
Sort
View
ICCS
2003
Springer
14 years 3 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
CDC
2009
IEEE
161views Control Systems» more  CDC 2009»
14 years 3 months ago
Consensus on homogeneous manifolds
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...
Alain Sarlette, Rodolphe Sepulchre
DAC
2010
ACM
14 years 2 months ago
Coverage in interpolation-based model checking
Coverage is a means to quantify the quality of a system specification, and is frequently applied to assess progress in system validation. Coverage is a standard measure in testin...
Hana Chockler, Daniel Kroening, Mitra Purandare
DLOG
2008
14 years 20 days ago
Consistency Checking for Extended Description Logics
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
Olivier Couchariere, Marie-Jeanne Lesot, Bernadett...
ATAL
2008
Springer
14 years 10 days ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro