Sciweavers

8 search results - page 2 / 2
» csc 2009
Sort
View
CSC
2009
13 years 6 months ago
An Empirical Analysis of Approximation Algorithms for Euclidean TSP
- 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...
Bárbara Rodeker, M. Virginia Cifuentes, Lil...
CSC
2009
13 years 6 months ago
Fast Monte Carlo Algorithms on Re-Wired Small-World Spin Models
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
Kenneth A. Hawick
CCS
2009
ACM
14 years 3 days ago
A practical property-based bootstrap architecture
Binary attestation, as proposed by the Trusted Computing Group (TCG), is a pragmatic approach for software integrity protection and verification. However, it has also various sho...
René Korthaus, Ahmad-Reza Sadeghi, Christia...