380 search results - page 7 / 76 » The End of Science Revisited |
133
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. This paper describes a practical approach for implementing certain types of domain-specific languages with extensible compilers. Given a compiler with one or more front-...
144
click to vote
C5
2008
IEEE
16 years 9 days ago
2008
IEEE
End-user scripting languages are relatively easy to learn, but have limited expressive power. Tile-based scripting systems are particularly accessible to beginners, but usually ar...
132
click to vote
STACS
2010
Springer
16 years 25 days ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
159
click to vote
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
127
click to vote
CSCW
2002
ACM
15 years 5 months ago
2002
ACM
This paper reports findings from a study of how a guidebook was used by pairs of visitors touring a historic house. We describe how the guidebook was incorporated into their visit...