Sciweavers

50 search results - page 7 / 10
» A Particular Universal Cellular Automaton
Sort
View
SASO
2008
IEEE
14 years 1 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
COMGEO
2011
ACM
12 years 10 months ago
Physical world as an internet of things
ABSTRACT . Categories and Subject Descriptors K. Computing Milieux K.m MISCELLANEOUS General Terms Theory Keywords Cyber-physics, Internet of Things, Quantum computing Cloud Comput...
Simon Berkovich
ATVA
2011
Springer
213views Hardware» more  ATVA 2011»
12 years 6 months ago
Max and Sum Semantics for Alternating Weighted Automata
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
Shaull Almagor, Orna Kupferman
ISVD
2007
IEEE
14 years 1 months ago
Voronoi Tessellations and the Cosmic Web: Spatial Patterns and Clustering across the Universe
The spatial cosmic matter distribution on scales of a few up to more than a hundred Megaparsec1 displays a salient and pervasive foamlike pattern. Voronoi tessellations are a vers...
Rien van de Weygaert