Sciweavers

421 search results - page 80 / 85
» Ant algorithms
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
KES
2005
Springer
14 years 26 days ago
Parameter Space Exploration of Agent-Based Models
When developping multi-agent systems (MAS) or models in the context of agent-based simulation (ABS), the tuning of the model constitutes a crucial step of the design process. Indee...
Benoît Calvez, Guillaume Hutzler
GECCO
2006
Springer
253views Optimization» more  GECCO 2006»
13 years 11 months ago
A novel approach to optimize clone refactoring activity
Achieving a high quality and cost-effective tests is a major concern for software buyers and sellers. Using tools and integrating techniques to carry out low cost testing are chal...
Salah Bouktif, Giuliano Antoniol, Ettore Merlo, Ma...
CVPR
2012
IEEE
11 years 9 months ago
FREAK: Fast Retina Keypoint
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
Alexandre Alahi, Raphael Ortiz, Pierre Vandergheyn...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....