1169 search results - page 20 / 234 » Degrees of monotone complexity |
IWDC
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Despite their crucial impact on the performances of p2p systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a ru...
VL
2009
IEEE
14 years 2 months ago
2009
IEEE
Understanding and maintaining the structure of large ontologies is a cognitively demanding task. Visualizations are commonly used as a cognitive aid for presenting large ontologie...
GCC
2003
Springer
14 years 22 days ago
2003
Springer
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new desi...
APAL
2011
13 years 2 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
WG
2001
Springer
13 years 12 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...