Sciweavers

2905 search results - page 90 / 581
» Formal Memetic Algorithms
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 9 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 3 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
14 years 3 months ago
Geometric differential evolution
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
Alberto Moraglio, Julian Togelius
FM
2008
Springer
171views Formal Methods» more  FM 2008»
13 years 10 months ago
Assume-Guarantee Verification for Interface Automata
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
Michael Emmi, Dimitra Giannakopoulou, Corina S. Pa...
MVA
1992
117views Computer Vision» more  MVA 1992»
13 years 10 months ago
Representing and Utilising Knowledge for Understanding Structured Documents
This paper presents a document analysis system which is capable of extracting the semantics of specific text portions of structured documents. The main component of the system is ...
Thomas Bayer