8540 search results - page 1602 / 1708 » The Dynamic Servers Problem |
139
click to vote
GI
2009
Springer
15 years 7 months ago
2009
Springer
: The era of ubiquitous and pervasive computing technology opens the world for new pervasive applications and services within the physical surroundings. Often users find themselves...
138
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
133
click to vote
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
128
click to vote
INFOCOM
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
126
click to vote
RTAS
1999
IEEE
15 years 7 months ago
1999
IEEE
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...