570 search results - page 17 / 114 » Approximating Some Network Design Problems with Node Costs |
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
JDA
2007
13 years 9 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
ATAL
2003
Springer
14 years 3 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...