3894 search results - page 109 / 779 » Approximation Algorithms for Biclustering Problems |
161
click to vote
AAAI
2008
15 years 8 months ago
2008
In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomia...
178
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
131
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
173
click to vote
APPROX
2009
Springer
16 years 29 days ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
153
click to vote
ADHOC
2010
15 years 6 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...