2996 search results - page 225 / 600 » Numberings and Randomness |
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— We examine the problem of determining which nodes are neighbors of a given one in a wireless network. We consider an unsupervised network operating on a frequencyflat Gaussian...
184
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
168
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Associative memories based on DNA-affinity have been proposed [2]. Here, the performance, efficiency, reliability of DNA-based memories is quantified through simulations in silico....
153
click to vote
APAL
2010
15 years 6 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
191
click to vote
CANDC
2004
ACM
15 years 6 months ago
2004
ACM
In recent years, stochastic modelling has emerged as a physically more realistic alternative for modelling in vivo reactions. There are numerous stochastic approaches available in...