Sciweavers

26354 search results - page 128 / 5271
» How we refactor, and how we know it
Sort
View
COMPLEXITY
2010
108views more  COMPLEXITY 2010»
13 years 7 months ago
How to make dull cellular automata complex by adding memory: Rule 126 case study
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system -- when enriched with memory
Genaro Juárez Martínez, Andrew Adama...
HCI
2011
13 years 1 months ago
How Children Can Design the Future
Over the past 15 years, children have become more integrally involved in the design of their technology. In this paper, we present the idea that design partnering methods, specific...
Mona Leigh Guha, Allison Druin, Jerry Alan Fails
JSYML
2010
114views more  JSYML 2010»
13 years 8 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
CHI
2009
ACM
14 years 11 months ago
Learning how: the search for craft knowledge on the internet
Communicating the subtleties of a craft technique, like putting a zipper into a garment or throwing a clay pot, can be challenging even when working side by side. Yet HowTo conten...
Cristen Torrey, Elizabeth F. Churchill, David W. M...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 10 months ago
How NOT to review a paper: the tools and techniques of the adversarial reviewer
There are several useful guides available for how to review a paper in Computer Science [10, 6, 12, 7, 2]. These are soberly presented, carefully reasoned and sensibly argued. As ...
Graham Cormode