Sciweavers

3874 search results - page 417 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
IJCAI
2003
15 years 8 months ago
Probabilistically Survivable MASs
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
Sarit Kraus, V. S. Subrahmanian, N. Cihan Tas
TCS
2011
15 years 1 months ago
Sorting and selection on dynamic data
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
TCS
2010
15 years 1 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee
INFOCOM
2011
IEEE
14 years 10 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
16 years 7 months ago
Conditional hardness for satisfiable 3-CSPs
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
Ryan O'Donnell, Yi Wu