123 search results - page 24 / 25 » Argument graphs and assumption-based argumentation |
STOC
2007
ACM
14 years 6 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
SPAA
2006
ACM
14 years 3 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
ECCC
2006
13 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
INFOCOM
2007
IEEE
14 years 13 days ago
2007
IEEE
—Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-pee...