300 search results - page 27 / 60 » Computer science: past, present, and future |
STACS
1999
Springer
15 years 2 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
WSKS
2009
Springer
15 years 4 months ago
2009
Springer
Nowadays, every public or private company has to provide the access to their services through Internet. Unfortunately, the access channels and devices increase both in numbers and ...
STACS
1999
Springer
15 years 2 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
GI
2004
Springer
15 years 3 months ago
2004
Springer
: Most of the investigations on ad hoc protocols do not consider the fact that future wireless networks are capable to adapt their behaviour to the channel situation. These adaptin...