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, ...
Effective teaching involves treating the presentation of new material and the assessment of students’ mastery of this material as part of a seamless and continuous feedback cycl...
Kimberle Koile, Kevin Chevalier, Michel Rbeiz, Ada...
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
Dependable systems evolution has been identified by the UK Computing Research Committee (UKCRC) as one of the current grand challenges for computer science. We present work toward...