Sciweavers

1242 search results - page 99 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 15 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 15 days ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
16 years 15 days ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius
APSEC
2001
IEEE
15 years 10 months ago
Compilation of Specifications
Computer software now controls critical systems worldwide. International standards require such programs to be produced from mathematically-precise specifications, but the techniq...
Colin J. Fidge