Sciweavers

4313 search results - page 671 / 863
» Using time travel to diagnose computer problems
Sort
View
FSTTCS
2006
Springer
15 years 11 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran
ACRI
2010
Springer
15 years 8 months ago
Network Decontamination with Temporal Immunity by Cellular Automata
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
Yassine Daadaa, Paola Flocchini, Nejib Zaguia
WOB
2004
120views Bioinformatics» more  WOB 2004»
15 years 8 months ago
Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
Ricardo P. Jacobi, Mauricio Ayala-Rincón, L...
CGF
2006
132views more  CGF 2006»
15 years 7 months ago
Verification of Physically Based Rendering Algorithms
Within computer graphics, the field of predictive rendering is concerned with those methods of image synthesis which yield results that do not only look real, but are also radiome...
Christiane Ulbricht, Alexander Wilkie, Werner Purg...
CN
2006
75views more  CN 2006»
15 years 7 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon