Sciweavers

4342 search results - page 225 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
OR
2004
Springer
15 years 10 months ago
Freight Flow Consolidation in Presence of Time Windows
This contribution addresses the consideration of time windows in the optimization of multi-commodity network flows. For each node, one interval is specified in which the visitati...
Jörn Schönberger, Herbert Kopfer
LCTRTS
2005
Springer
15 years 11 months ago
Upper bound for defragmenting buddy heaps
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
Delvin C. Defoe, Sharath R. Cholleti, Ron Cytron
ASPLOS
1992
ACM
15 years 9 months ago
Design and Evaluation of a Compiler Algorithm for Prefetching
Software-controlled data prefetching is a promising technique for improving the performance of the memory subsystem to match today's high-performance processors. While prefet...
Todd C. Mowry, Monica S. Lam, Anoop Gupta
136
Voted
CCCG
2006
15 years 6 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
CC
2004
Springer
110views System Software» more  CC 2004»
15 years 10 months ago
The Limits of Alias Analysis for Scalar Optimizations
In theory, increasing alias analysis precision should improve compiler optimizations on C programs. This paper compares alias analysis algorithms on scalar optimizations, including...
Rezaul Alam Chowdhury, Peter Djeu, Brendon Cahoon,...