Sciweavers

10051 search results - page 1849 / 2011
» A Dynamic Separator Algorithm
Sort
View
119
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
Praveen Kumar Muthuswamy, Koushik Kar, Sambit Sahu...
ISPDC
2010
IEEE
15 years 1 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
JIRS
2010
104views more  JIRS 2010»
15 years 1 months ago
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
Armando Alves Neto, Douglas Guimarães Macha...
JSAC
2010
143views more  JSAC 2010»
15 years 1 months ago
Balancing competing resource allocation demands in a public cellular network that supports emergency services
Abstract—When an emergency happens, public communication networks, including cellular networks, public switched telecommunication networks, and the Internet can be utilized to su...
Jiazhen Zhou, C. Beard
132
Voted
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 1 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
« Prev « First page 1849 / 2011 Last » Next »