Sciweavers

97 search results - page 11 / 20
» Modeling and Optimization Problems in Contact Centers
Sort
View
COMPGEOM
2010
ACM
14 years 2 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
ICAC
2007
IEEE
14 years 4 months ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
IPSN
2004
Springer
14 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
EOR
2007
69views more  EOR 2007»
13 years 9 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 4 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...