Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...
Abstract. An experiment is reported that compared expandable indexes providing full menu context with sequentialmenus providing only partial context. Menu depth was varied using hi...
Panayiotis Zaphiris, Ben Shneiderman, Kent L. Norm...
Abstract. The coordinated reaction to a large-scale disaster is a challenging research problem. The Robocup rescue simulation league addresses this research problem but is currentl...
Abstract. In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our o...
Abstract. As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenancealgorithms for balanced trees. In terms of code simplicity, ou...