320 search results - page 5 / 64 » Run-Time Support for Optimizations Based on Escape Analysis |
93
Voted
CSC
2009
14 years 10 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
104
click to vote
DBSEC
2006
14 years 11 months ago
2006
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
KCAP
2011
ACM
14 years 13 days ago
2011
ACM
Open Information Extraction extracts relations from text without requiring a pre-specified domain or vocabulary. While existing techniques have used only shallow syntactic featur...
95
Voted
SWAT
1992
Springer
15 years 1 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
ISSTA
2000
ACM
15 years 1 months ago
2000
ACM
This paper presents a strategy for structural testing of objectoriented software systems with possibly unknown clients and unknown information about invoked methods. By exploiting...