64 search results - page 9 / 13 » Computability of Countable Subshifts |
ICCSA
2007
Springer
14 years 4 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
FM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
AIA
2006
13 years 11 months ago
2006
In a manufacturing environment it is often necessary to perform a manual inventory of finished goods and raw materials. These raw materials might be wood, plastic or metal and oft...
BSL
2005
13 years 9 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...