Sciweavers

3367 search results - page 273 / 674
» Incremental assignment problem
Sort
View
IPPS
2003
IEEE
15 years 9 months ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
CP
2003
Springer
15 years 9 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
ICDCS
2002
IEEE
15 years 9 months ago
On Peer-to-Peer Media Streaming
In this paper, we study a peer-to-peer media streaming system with the following characteristics: (1) its streaming capacity grows dynamically; (2) peers do not exhibit serverlike...
Dongyan Xu, Mohamed Hefeeda, Susanne E. Hambrusch,...
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 8 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
INFOCOM
1997
IEEE
15 years 8 months ago
Channel Carrying: A Novel Handoff Scheme for Mobile Cellular Networks
— We present a new scheme that addresses the call handoff problem in mobile cellular networks. Efficiently solving the handoff problem is important for guaranteeing quality of s...
Junyi Li, Ness B. Shroff, Edwin K. P. Chong