Sciweavers

6978 search results - page 82 / 1396
» On Proofs in System P
Sort
View
CC
2006
Springer
133views System Software» more  CC 2006»
14 years 10 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
RR
2007
Springer
15 years 4 months ago
Proof Explanation in the DR-DEVICE System
Trust is a vital feature for the Semantic Web: If users (humans and agents) are to use and integrate system answers, they must trust them. Thus, systems should be able to explain t...
Nick Bassiliades, Grigoris Antoniou, Guido Governa...
ISW
2009
Springer
15 years 4 months ago
Adding Trust to P2P Distribution of Paid Content
While peer-to-peer (P2P) file-sharing is a powerful and cost-effective content distribution model, most paid-for digital-content providers (CPs) use direct download to deliver th...
Alex Sherman, Angelos Stavrou, Jason Nieh, Angelos...
NCA
2007
IEEE
15 years 4 months ago
Exploiting Host Name Locality for Reduced Stretch P2P Routing
Structured P2P networks are a promising alternative for engineering new distributed services and for replacing existing distributed services like DNS. Providing competitive perfor...
Gert Pfeifer, Christof Fetzer, Thomas Hohnstein
ICOIN
2005
Springer
15 years 3 months ago
DINPeer: Optimized P2P Communication Network
In this paper, we propose DINPeer middleware to overcome limitations in current peer-to-peer (P2P) overlay systems. DINPeer exploits a spiral-ring method to discover an inner ring ...
Huaqun Guo, Lek Heng Ngoh, Wai-Choong Wong, Ligang...