Sciweavers

358 search results - page 27 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
WWW
2008
ACM
16 years 4 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
TSP
2008
92views more  TSP 2008»
15 years 3 months ago
Distributed Structures, Sequential Optimization, and Quantization for Detection
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
Michael A. Lexa, Don H. Johnson
SIGECOM
2005
ACM
166views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
A price-anticipating resource allocation mechanism for distributed shared clusters
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
Michal Feldman, Kevin Lai, Li Zhang
ATAL
2004
Springer
15 years 9 months ago
The Advantages of Compromising in Coalition Formation with Incomplete Information
This paper presents protocols and strategies for coalition formation with incomplete information under time constraints. It focuses on strategies for coalition members to distribu...
Sarit Kraus, Onn Shehory, Gilad Taase
ICPP
2002
IEEE
15 years 9 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran