Sciweavers

2606 search results - page 181 / 522
» cost 2008
Sort
View
CCCG
2008
15 years 8 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
MASCOTS
2008
15 years 8 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park
COR
2006
82views more  COR 2006»
15 years 6 months ago
Batching work and rework processes with limited deterioration of reworkables
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov,...
IOR
2008
128views more  IOR 2008»
15 years 6 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer
IOR
2008
91views more  IOR 2008»
15 years 6 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...