Sciweavers

1484 search results - page 87 / 297
» Ants meeting algorithms
Sort
View
ANTS
1998
Springer
114views Algorithms» more  ANTS 1998»
14 years 2 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»
14 years 1 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
CF
2005
ACM
14 years 5 days 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
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
14 years 3 months ago
Bayesian optimization models for particle swarms
We explore the use of information models as a guide for the development of single objective optimization algorithms, giving particular attention to the use of Bayesian models in a...
Christopher K. Monson, Kevin D. Seppi
HM
2007
Springer
180views Optimization» more  HM 2007»
14 years 2 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...