Sciweavers

941 search results - page 116 / 189
» Efficient Testing of Large Graphs
Sort
View
HIS
2009
14 years 7 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
OSDI
2008
ACM
15 years 10 months ago
Finding and Reproducing Heisenbugs in Concurrent Programs
Concurrency is pervasive in large systems. Unexpected interference among threads often results in "Heisenbugs" that are extremely difficult to reproduce and eliminate. W...
Gérard Basler, Iulian Neamtiu, Madanlal Mus...
ASPLOS
2009
ACM
15 years 10 months ago
CTrigger: exposing atomicity violation bugs from their hiding places
Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different types of concurrency bugs, atomicity violation bu...
Soyeon Park, Shan Lu, Yuanyuan Zhou
ICPR
2000
IEEE
15 years 11 months ago
Comparison of Face Verification Results on the XM2VTS Database
The paper presents results of the face verification contest that was organized in conjunction with International Conference on Pattern Recognition 2000 [14]. Participants had to u...
Jiri Matas, Miroslav Hamouz, Kenneth Jonsson, Jose...
EOR
2008
75views more  EOR 2008»
14 years 9 months ago
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
Ramón Alvarez-Valdés, Enric Crespo, ...