Sciweavers

31 search results - page 5 / 7
» A New One-Pass Transformation into Monadic Normal Form
Sort
View
CIARP
2009
Springer
14 years 22 days ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales
CSCLP
2008
Springer
13 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
14 years 6 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das
VMCAI
2004
Springer
13 years 11 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
IJPRAI
2002
97views more  IJPRAI 2002»
13 years 5 months ago
Shape Description and Invariant Recognition Employing Connectionist Approach
This paper presents a new approach for shape description and invariant recognition by geometric-normalization implemented by neural networks. The neural system consists of a shape...
Jezekiel Ben-Arie, Zhiqian Wang