Sciweavers

7133 search results - page 447 / 1427
» Communication algorithms with advice
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Equation-Based Packet Marking for Assured Forwarding Services
Abstract— This paper introduces a new packet marking algorithm that can be used in the context of Assured Forwarding (AF) in the Differentiated Services (DiffServ) framework [1],...
Mohamed A. El-Gendy, Kang G. Shin
INFOCOM
1998
IEEE
15 years 11 months ago
Timer Reconsideration for Enhanced RTP Scalability
RTP, the Real Time Transport Protocol, has gained widespread acceptance as the transport protocol for voice and video on the Internet. Its companion control protocol, the Real Tim...
Jonathan Rosenberg, Henning Schulzrinne
ATAL
2006
Springer
15 years 10 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
FSTTCS
1995
Springer
15 years 10 months ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
INFOCOM
2010
IEEE
15 years 5 months ago
On Scheduling for Minimizing End-to-End Buffer Usage over Multihop Wireless Networks
—While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) ...
V. J. Venkataramanan, Xiaojun Lin, Lei Ying, Sanja...