685 search results - page 19 / 137 » Closure Operators for Order Structures |
129
click to vote
MOC
1998
14 years 11 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
116
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
GI
2004
Springer
15 years 5 months ago
2004
Springer
: Critical industrial applications or fault tolerant applications need for operating systems (OS) which guarantee a correct and safe behaviour despite the appearance of errors. In ...