Sciweavers

5634 search results - page 45 / 1127
» About Abstract Classes
Sort
View
SIGCSE
2009
ACM
143views Education» more  SIGCSE 2009»
15 years 5 months ago
Thinking about computational thinking
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
James J. Lu, George H. L. Fletcher
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 2 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
SOFTWARE
2008
14 years 10 months ago
What Do We Know about Developer Motivation?
s of titles and abstracts) as irrelevant to our focus. We read the remaining 519 papers in full to establish our final list. The 92 papers we chose were originally published in the...
Tracy Hall, Helen Sharp, Sarah Beecham, Nathan Bad...
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
15 years 5 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
SIAMCO
2010
128views more  SIAMCO 2010»
14 years 5 months ago
A Class of Self-Interacting Processes with Applications to Games and Reinforced Random Walks
Abstract. This paper studies a class of non-Markovian and nonhomogeneous stochastic processes on a finite state space. Relying on a recent paper by Bena
Michel Benaïm, Olivier Raimond