Bandwidth Allocation and Pricing Problem for a Duopoly Market
Page 1
Displaying 1 – 9 of 9
Benders decomposition for local access network design with two technologies.
Randazzo, C.D., Luna, H.P.L., Mahey, P. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Boundedness on stochastic Petri nets.
J. Campos, F. Plo, M. San Miguel (1993)
Revista Matemática de la Universidad Complutense de Madrid
Stochastic Petri nets generalize the notion of queuing systems and are a useful model in performance evaluation of parallel and distributed systems. We give necessary and sufficient conditions for the boundedness of a stochastic process related to these nets.
Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population
Andrzej Dziech, Andrzej R. Pach (1989)
Kybernetika
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)
RAIRO - Operations Research
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)
RAIRO - Operations Research
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...
Bringing introspection into BlobSeer: Towards a self-adaptive distributed data management system
Alexandra Carpen-Amarie, Alexandru Costan, Jing Cai, Gabriel Antoniu, Luc Bougé (2011)
International Journal of Applied Mathematics and Computer Science
Introspection is the prerequisite of autonomic behavior, the first step towards performance improvement and resource usage optimization for large-scale distributed systems. In grid environments, the task of observing the application behavior is assigned to monitoring systems. However, most of them are designed to provide general resource information and do not consider specific information for higher-level services. More precisely, in the context of data-intensive applications, a specific introspection...
Buffer overflow period in a MAP queue.
Chydzinski, Andrzej (2007)
Mathematical Problems in Engineering
Building representative-based data aggregation tree in wireless sensor networks.
Zheng, Yanfei, Chen, Kefei, Qiu, Weidong (2010)
Mathematical Problems in Engineering
Currently displaying 1 – 9 of 9
Page 1