Sciweavers

2354 search results - page 217 / 471
» Randomness, Stochasticity and Approximations
Sort
View
134
Voted
ICC
2008
IEEE
130views Communications» more  ICC 2008»
15 years 11 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
ICNP
2007
IEEE
15 years 11 months ago
FRASA: Feedback Retransmission Approximation for the Stability Region of Finite-User Slotted ALOHA
—FRASA, Feedback Retransmission Approximation for Slotted ALOHA, is proposed to study the stability region of finiteuser slotted ALOHA under collision channel. With FRASA, the s...
Ka-Hung Hui, On-Ching Yue, Wing Cheong Lau
SARA
2005
Springer
15 years 10 months ago
Feature-Discovering Approximate Value Iteration Methods
Sets of features in Markov decision processes can play a critical role ximately representing value and in abstracting the state space. Selection of features is crucial to the succe...
Jia-Hong Wu, Robert Givan
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 8 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 8 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski