Sciweavers

3096 search results - page 218 / 620
» The Generalized FITC Approximation
Sort
View
IOR
2010
90views more  IOR 2010»
15 years 3 months ago
No-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems
This paper analyzes a class of common-component allocation rules, termed no-holdback (NHB) rules, in continuous-review assemble-to-order (ATO) systems. We assume that component in...
Yingdong Lu, Jing-Sheng Song, Yao Zhao
JAIR
2010
115views more  JAIR 2010»
15 years 3 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
JCO
2010
101views more  JCO 2010»
15 years 3 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
QUESTA
2010
131views more  QUESTA 2010»
15 years 3 months ago
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous servi...
Maaike Verloop, R. Núñez Queija
TCS
2010
15 years 3 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer