Sciweavers

520 search results - page 73 / 104
» Implementing a Generalized Version of Resolution
Sort
View
JPDC
2006
106views more  JPDC 2006»
14 years 9 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn
SCN
2008
Springer
14 years 9 months ago
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
Guilhem Castagnos
TEC
2002
133views more  TEC 2002»
14 years 9 months ago
Learning and optimization using the clonal selection principle
The clonal selection principle is used to explain the basic features of an adaptive immune response to an antigenic stimulus. It establishes the idea that only those cells that rec...
Leandro Nunes de Castro, Fernando J. Von Zuben
TEC
2002
183views more  TEC 2002»
14 years 9 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
TIT
2011
119views more  TIT 2011»
14 years 4 months ago
Minimax Robust Quickest Change Detection
—The popular criteria of optimality for quickest change detection procedures are the Lorden criterion, the Pollak criterion, and the Bayesian criterion. In this paper, a robust v...
Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli...