59 search results - page 2 / 12 » Generalized Semi-Infinite Programming: on generic local mini... |
KDD
2003
ACM
14 years 5 months ago
2003
ACM
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
EACL
2009
ACL Anthology
14 years 5 months ago
2009
ACL Anthology
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
ECOOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...
SIAMDM
2010
13 years 3 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
CC
2008
Springer
13 years 7 months ago
2008
Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...