15485 search results - page 2809 / 3097 » Computing Optimal Subsets |
150
click to vote
JPDC
2006
15 years 6 months ago
2006
The vulnerability of computer nodes due to component failures is a critical issue for cluster-based file systems. This paper studies the development and deployment of mirroring in...
161
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
185
click to vote
JSS
2006
15 years 6 months ago
2006
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. ...
158
click to vote
EOR
2007
15 years 6 months ago
2007
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
170
click to vote
EOR
2007
15 years 6 months ago
2007
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...