Sciweavers

949 search results - page 81 / 190
» Programmed Mutagenesis Is Universal
Sort
View
ICALP
2000
Springer
15 years 8 months ago
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, ...
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 8 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
ICALP
2010
Springer
15 years 6 months ago
Example-Guided Abstraction Simplification
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
Roberto Giacobazzi, Francesco Ranzato
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 4 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
IFIP
2010
Springer
14 years 11 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...