Sciweavers

1263 search results - page 169 / 253
» A* with Bounded Costs
Sort
View
WSC
2008
13 years 11 months ago
Simulation based optimization of multi-location transshipment problem with capacitated transportation
In this study, a single-item two-echelon inventory system where the items can be stored in each of N stocking locations is optimized using simulation. The aim of this study is to ...
Banu Yetkin Ekren, Sunderesh S. Heragu
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
13 years 10 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
FLAIRS
2004
13 years 10 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
ADHOC
2007
173views more  ADHOC 2007»
13 years 9 months ago
QoS multicast routing by using multiple paths/trees in wireless ad hoc networks
In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blo...
Huayi Wu, Xiaohua Jia
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 9 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer