Sciweavers

2905 search results - page 26 / 581
» Formal Memetic Algorithms
Sort
View
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
14 years 11 days ago
On the generality of parameter tuning in evolutionary planning
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. However, like any Evolutionary Algorithm, DaE has se...
Jacques Bibai, Pierre Savéant, Marc Schoena...
IPPS
2006
IEEE
14 years 1 months ago
Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
Peter Csaba Ölveczky, Stian Thorvaldsen
JCST
2010
189views more  JCST 2010»
13 years 2 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
FASE
2006
Springer
13 years 11 months ago
Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...
Peter Csaba Ölveczky, Marco Caccamo