Sciweavers

291 search results - page 30 / 59
» Approximate centerpoints with proofs
Sort
View
INFOCOM
2009
IEEE
14 years 5 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
STOC
2009
ACM
146views Algorithms» more  STOC 2009»
14 years 11 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
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 3 months ago
A new multilayered PCP and the hardness of hypergraph vertex cover
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
Irit Dinur, Venkatesan Guruswami, Subhash Khot, Od...
NIPS
2007
14 years 2 days ago
Incremental Natural Actor-Critic Algorithms
We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic reinforcement learning m...
Shalabh Bhatnagar, Richard S. Sutton, Mohammad Gha...
APLAS
2005
ACM
14 years 4 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot