298 search results - page 18 / 60 » Competitive Analysis of Flash-Memory Algorithms |
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
The best evolutionary approach can be a difficult problem. In this work we have investigated two evolutionary representations to evolve non-photorealistic renderings: a variable-le...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
COR
2011
14 years 4 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...