20 search results - page 4 / 4 » ams 1999 |
CORR
1999
Springer
13 years 5 months ago
1999
Springer
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
GI
2005
Springer
13 years 11 months ago
2005
Springer
: Die Arbeitsgruppe Echtzeitsysteme und Kommunikation an der Fakultät für Informatik der Otto-von-Guericke-Universität Magdeburg nutzt die Attraktivität von Roboterbaukästen, ...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
CPC
1999
13 years 5 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
GI
2003
Springer
13 years 10 months ago
2003
Springer
: Als Einführung in den Workshop reflektiert der Beitrag die bisherigen Geschichtsberachtungen von Pionieren und Historikern des Internet. Er möchte zeigen, dass die bislang domi...