Sciweavers

856 search results - page 141 / 172
» Dependent Types in Practical Programming
Sort
View
148
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 1 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
PPNA
2011
14 years 5 months ago
Ad-hoc limited scale-free models for unstructured peer-to-peer networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Durgesh Rani Kumari, Hasan Guclu, Murat Yuksel
SIGSOFT
1996
ACM
15 years 6 months ago
Tool Support for Planning the Restructuring of Data Abstractions in Large Systems
Abstractions in Large Systems William G. Griswold, Member, IEEE, Morison I. Chen, Robert W. Bowdidge, Jenny L. Cabaniss, Van B. Nguyen, and J. David Morgenthaler Restructuring soft...
William G. Griswold, Morison I. Chen, Robert W. Bo...
114
Voted
AI
2011
Springer
14 years 9 months ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
15 years 7 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm