494 search results - page 87 / 99 » Heap Building Bounds |
SODA
2010
ACM
15 years 8 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
SENSYS
2009
ACM
15 years 5 months ago
2009
ACM
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
95
Voted
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
118
Voted
ALGOSENSORS
2009
Springer
15 years 5 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
ATAL
2009
Springer
2009
Springer
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
15 years 5 months ago
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...