NGC
2002
Springer
13 years 11 months ago
2002
Springer
NGC
2002
Springer
13 years 11 months ago
2002
Springer
Efficient handling of mobile nodes in a multicast environment is a non-trivial task. Solutions based on bi-directional tunneling introduce encapsulation and triangular routing. Th...
NGC
2002
Springer
13 years 11 months ago
2002
Springer
In this paper we aim at developing a solution to fairly allocating bandwidth among unicast and multicast flows. For this purpose, we propose the anycast max-min fairness criterion,...
NGC
2002
Springer
13 years 11 months ago
2002
Springer
NGC
2002
Springer
13 years 11 months ago
2002
Springer
The programmable network approach is one possible solution to quickly adapt existing infrastructures to new requirements. This paper shows how programmable networking can be explo...
NGC
1998
Springer
13 years 11 months ago
1998
Springer
Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications r...
NGC
1998
Springer
13 years 11 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
ITA
2002
13 years 11 months ago
2002
ITA
2002
13 years 11 months ago
2002
ITA
2002
13 years 11 months ago
2002
Abstract. We investigate the density of critical factorizations of infinte sequences of words. The density of critical factorizations of a word is the ratio between the number of p...