A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ā...
Meng-Zhen Kang, Philippe de Reffye, Jean Fran&cced...
We show how and why using genetic operators that are applied with probabilities that depend on the ļ¬tness rank of a genotype or phenotype oļ¬ers a robust alternative to the Sim...
In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management tech...
Wu-chang Feng, Kang G. Shin, Dilip D. Kandlur, Deb...
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...