Sciweavers

10271 search results - page 1611 / 2055
» Computer Science
Sort
View
ICALP
2000
Springer
15 years 10 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, ...
AAAI
2007
15 years 9 months ago
Supporting Feedback and Assessment of Digital Ink Answers to In-Class Exercises
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...
ECAI
2006
Springer
15 years 8 months ago
Solving Optimization Problems with DLL
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...
Enrico Giunchiglia, Marco Maratea
AAAI
2010
15 years 8 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
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...
BCS
2008
15 years 8 months ago
Tools for Traceable Security Verification
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...
Jan Jürjens, Yijun Yu, Andreas Bauer 0002
« Prev « First page 1611 / 2055 Last » Next »