Sciweavers

5499 search results - page 335 / 1100
» Generalized Rewrite Theories
Sort
View
183
Voted
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
16 years 1 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
209
Voted
HT
2005
ACM
16 years 1 months ago
Mind the semantic gap
Hypertext can be seen as a logic representation, where semantics are encoded in both the textual nodes and the graph of links. Systems that have a very formal representation of th...
David E. Millard, Nicholas Gibbins, Danius T. Mich...
172
Voted
ATAL
2005
Springer
16 years 1 months ago
Negotiating over small bundles of resources
When rational but myopic agents negotiate over the exchange of indivisible resources, any restriction to the negotiation protocol may prevent the system from converging to a socia...
Yann Chevaleyre, Ulle Endriss, Jérôme...
192
Voted
ATAL
2005
Springer
16 years 1 months ago
A simulator for multi-agent partnership formation based on dependence graphs
The PartNET++ system is an experimental multi-agent-based simulation tool that uses a new model based on hyper-graphs for understanding partnership formation among heterogeneous a...
Júlio de Lima do Rêgo Monteiro, Jaime...
CCS
2005
ACM
16 years 1 months ago
On the cost-ineffectiveness of redundancy in commercial P2P computing
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
Matthew Yurkewych, Brian Neil Levine, Arnold L. Ro...