Sciweavers

436 search results - page 72 / 88
» Ant algorithms and stigmergy
Sort
View
HM
2005
Springer
97views Optimization» more  HM 2005»
15 years 5 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...
Pierre Delisle, Marc Gravel, Michaël Krajecki...
ANTS
1998
Springer
114views Algorithms» more  ANTS 1998»
15 years 3 months ago
Dense Admissible Sets
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
Daniel M. Gordon, Eugene R. Rodemich
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
15 years 3 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
ACIIDS
2009
IEEE
215views Database» more  ACIIDS 2009»
15 years 2 months ago
Proposed Nature Inspired Self-Organized Secure Autonomous Mechanism for WSNs
The field of wireless sensor network (WSN) is an important and challenging research area today. Advancements in sensor networks enable a wide range of environmental monitoring and ...
K. Saleem, Norsheila Fisal, M. S. Abdullah, A. B. ...
CF
2005
ACM
15 years 1 months ago
Marching-pixels: a new organic computing paradigm for smart sensor processor arrays
In this paper we present a new organic computing principle denoted as marching pixels for the architectures of future smart CMOS camera chips. The idea of marching pixels is based...
Dietmar Fey, Daniel Schmidt 0003