Sciweavers

969 search results - page 9 / 194
» Generalized matching from theory to application
Sort
View
SIGCOMM
2003
ACM
14 years 1 months ago
Network routing with path vector protocols: theory and applications
Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In th...
João L. Sobrinho
ECOOP
1998
Springer
14 years 5 days ago
Predicate Dispatching: A Unified Theory of Dispatch
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between pr...
Michael D. Ernst, Craig S. Kaplan, Craig Chambers
CN
2006
95views more  CN 2006»
13 years 8 months ago
Generalized Nash Bargaining Solution for bandwidth allocation
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...
Corinne Touati, Eitan Altman, Jérôme ...
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
DGO
2006
112views Education» more  DGO 2006»
13 years 9 months ago
Matching and integration across heterogeneous data sources
A sea of undifferentiated information is forming from the body of data that is collected by people and organizations, across government, for different purposes, at different times...
Patrick Pantel, Andrew Philpot, Eduard H. Hovy