2137 search results - page 347 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
141
click to vote
AAMAS
2011
Springer
14 years 9 months ago
2011
Springer
How does one repeatedly choose actions so as to be fairest to the multiple beneficiaries of those actions? We examine approaches to discovering sequences of actions for which the...
141
Voted
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
110
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
116
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
122
click to vote
CGO
2003
IEEE
15 years 6 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...