141 search results - page 6 / 29 » Heap Assumptions on Demand |
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
SRDS
2003
IEEE
14 years 20 days ago
2003
IEEE
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the “replenishment cycle” policy). Under the non-stationary demand assumption...
ICCV
1998
IEEE
14 years 9 months ago
1998
IEEE
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...