Sciweavers

27 search results - page 2 / 6
» Further Investigations into Regular XORSAT
Sort
View
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
13 years 9 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
JSAC
2010
91views more  JSAC 2010»
13 years 3 months ago
Constructing low-connectivity and full-coverage three dimensional sensor networks
Abstract—Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k...
Chuanlin Zhang, Xiaole Bai, Jin Teng, Dong Xuan, W...
ISAMI
2010
13 years 3 months ago
Employing Compact Intra-genomic Language Models to Predict Genomic Sequences and Characterize Their Entropy
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
Sérgio A. D. Deusdado, Paulo Carvalho
TACS
2001
Springer
13 years 9 months ago
Non-structural Subtype Entailment in Automata Theory
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
Joachim Niehren, Tim Priesnitz
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 7 months ago
A Particular Universal Cellular Automaton
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...
Nicolas Ollinger, Gaétan Richard