Sciweavers

2024 search results - page 92 / 405
» A Formal Model of Multi-agent Computations
Sort
View
TCS
2010
15 years 2 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
RECOMB
2008
Springer
16 years 4 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye
WSC
1996
15 years 5 months ago
Simulation for computer science majors: a preliminary report
The author is revising and restructuring an existing simulation course designed primarily for senior computer science majors by: 1) developing an integrated set of laboratory exer...
Ruth Silverman
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
15 years 9 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
124
Voted
SACRYPT
1998
Springer
15 years 8 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...