Sciweavers

1690 search results - page 154 / 338
» Algorithmic Properties of Millstream Systems
Sort
View
FSE
2005
Springer
108views Cryptology» more  FSE 2005»
15 years 12 months ago
Unbiased Random Sequences from Quasigroup String Transformations
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
Smile Markovski, Danilo Gligoroski, Ljupco Kocarev
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 10 months ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter
COMPGEOM
2010
ACM
15 years 11 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
ICAC
2005
IEEE
16 years 1 days ago
Decentralised Autonomic Computing: Analysing Self-Organising Emergent Behaviour using Advanced Numerical Methods
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
Tom De Wolf, Giovanni Samaey, Tom Holvoet, Dirk Ro...
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 11 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga