Sciweavers

979 search results - page 175 / 196
» Optimal instruction scheduling using integer programming
Sort
View
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
ICWN
2004
13 years 10 months ago
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
Maulin Patel, R. Chandrasekaran, S. Venkatesan
EOR
2010
102views more  EOR 2010»
13 years 8 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
EOR
2007
88views more  EOR 2007»
13 years 8 months ago
The stochastic location model with risk pooling
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
Lawrence V. Snyder, Mark S. Daskin, Chung-Piaw Teo
TON
2010
118views more  TON 2010»
13 years 7 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho