1830 search results - page 218 / 366 » Workshop on Graph Computation Models |
125
click to vote
SIGECOM
2009
ACM
16 years 23 days ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
153
click to vote
ICDCS
2006
IEEE
16 years 9 days ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
162
click to vote
SPIN
2009
Springer
16 years 23 days ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
155
click to vote
NETCOOP
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. Optical Burst Switching proposes a future-proof alternative to the current electronic switching in the backbone. The involved optical buffers are implemented with a set o...
162
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Distributed transactional memory (TM) models based on globally-consistent contention management policies may abort many transactions that could potentially commit without violatin...