Sciweavers

914 search results - page 104 / 183
» Branch and Bound on the Network Model
Sort
View
DSN
2011
IEEE
13 years 9 months ago
Approximate analysis of blocking queueing networks with temporal dependence
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
Vittoria de Nitto Persone, Giuliano Casale, Evgeni...
INFOCOM
2009
IEEE
15 years 4 months ago
Protecting Against Network Infections: A Game Theoretic Perspective
— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
Jasmina Omic, Ariel Orda, Piet Van Mieghem
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
14 years 11 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
ICPR
2002
IEEE
15 years 11 months ago
Bayesian Networks as Ensemble of Classifiers
Classification of real-world data poses a number of challenging problems. Mismatch between classifier models and true data distributions on one hand and the use of approximate inf...
Ashutosh Garg, Vladimir Pavlovic, Thomas S. Huang
MFCS
2007
Springer
15 years 4 months ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc