Sciweavers

3367 search results - page 216 / 674
» Incremental assignment problem
Sort
View
140
Voted
HASE
2008
IEEE
15 years 10 months ago
Power Optimization in Fault-Tolerant Mobile Ad Hoc Networks
—In this paper, we investigate the transmission-power assignment problem for k-connected mobile ad hoc networks (MANETs), the problem of optimizing the lifetime of a MANET at a g...
Oliviero Riganelli, Radu Grosu, Samir R. Das, C. R...
123
Voted
AAAI
2008
15 years 6 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
133
Voted
IPL
2007
113views more  IPL 2007»
15 years 3 months ago
Greedy online frequency allocation in cellular networks
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
125
Voted
FOCS
2003
IEEE
15 years 9 months ago
Always Good Turing: Asymptotically Optimal Probability Estimation
While deciphering the Enigma Code during World War II, I.J. Good and A.M. Turing considered the problem of estimating a probability distribution from a sample of data. They derive...
Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
129
Voted
IMC
2003
ACM
15 years 9 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella