Sciweavers

555 search results - page 8 / 111
» Improved results for a memory allocation problem
Sort
View
FOCS
2008
IEEE
14 years 11 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel
IWMM
2007
Springer
110views Hardware» more  IWMM 2007»
15 years 4 months ago
Path: page access tracking to improve memory management
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. ...
Reza Azimi, Livio Soares, Michael Stumm, Thomas Wa...
CIG
2005
IEEE
15 years 3 months ago
Case-Injection Improves Response Time for a Real-Time Strategy Game
We present a case-injected genetic algorithm player for Strike Ops, a real-time strategy game. Such strategy games are fundamentally resource allocation optimization problems and o...
Chris Miles, Sushil J. Louis
CLUSTER
2001
IEEE
15 years 1 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
ICCS
2004
Springer
15 years 3 months ago
Improving Geographical Locality of Data for Shared Memory Implementations of PDE Solvers
On cc-NUMA multi-processors, the non-uniformity of main memory latencies motivates the need for co-location of threads and data. We call this special form of data locality, geogra...
Henrik Löf, Markus Nordén, Sverker Hol...