Sciweavers

9736 search results - page 8 / 1948
» How Fast Can We Compute Products
Sort
View
STACS
2005
Springer
15 years 9 months ago
How Common Can Be Universality for Cellular Automata?
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
Guillaume Theyssier
SPDP
1993
IEEE
15 years 8 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
STACS
1999
Springer
15 years 8 months ago
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
Abstract. In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k−2) low...
Mario Szegedy
123
Voted
HCI
2011
14 years 7 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
CHI
2007
ACM
16 years 4 months ago
How informances can be used in design ethnography
In this paper we discuss how we've adapted the technique of informance design for use in design ethnography. We detail our design ethnography workflow method and describe our...
Ron Wakkary, Madison Poon, Leah Maestri, Travis Ki...