345 search results - page 30 / 69 » Computer-Assisted Simulation Proofs |
116
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
126
Voted
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Creole is a new born language emerging in most cases where language contact takes place. Simulating behaviors that creole communities are formed in some environments, we could cont...
111
click to vote
ICCS
2003
Springer
15 years 7 months ago
2003
Springer
Performance analysis of real applications in clusters and GRID like environments is essential to fully exploit the performance of new architectures. The key problem is the deepenin...
109
click to vote
CAV
2006
Springer
15 years 6 months ago
2006
Springer
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
100
Voted
WSC
2004
15 years 3 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...