Sciweavers

1989 search results - page 59 / 398
» cost 2010
Sort
View
EOR
2006
65views more  EOR 2006»
14 years 12 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
EOR
2006
120views more  EOR 2006»
14 years 12 months ago
Approximate and exact algorithms for the fixed-charge knapsack problem
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Umit Akinc
EOR
2007
80views more  EOR 2007»
14 years 11 months ago
Coherent risk measures in inventory problems
We analyze an extension of the classical multi-period, single-item, linear cost inventory problem where the objective function is a coherent risk measure. Properties of coherent r...
Shabbir Ahmed, Ulas Çakmak, Alexander Shapi...
COMCOM
2010
246views more  COMCOM 2010»
14 years 10 months ago
Tabu search algorithm for RP selection in PIM-SM multicast routing
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
Hua Wang, Xiangxu Meng, Min Zhang, Yanlong Li
IOT
2010
14 years 9 months ago
On the calibration and performance of RSS-based localization methods
This paper analyzes the performance of several Received Signal Strength (RSS) based localization methods as a function of the calibration effort, hence as a function of deployment ...
Bram Dil, Paul J. M. Havinga