Sciweavers

1897 search results - page 194 / 380
» Sparse Additive Machine
Sort
View
ITCC
2002
IEEE
15 years 11 months ago
FSM Implementation in Embedded Memory Blocks of Programmable Logic Devices Using Functional Decomposition
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
Henry Selvaraj, Mariusz Rawski, Tadeusz Luba
ECAL
1999
Springer
15 years 10 months ago
Arithmetic Operations on Self-Replicating Cellular Automata
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
Enrico Petraglio, Jean-Marc Henry, Gianluca Tempes...
COMPSYSTECH
2007
15 years 10 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...
POPL
1997
ACM
15 years 9 months ago
Parameterized Types for Java
Java offers the real possibility that most programs can be written in a type-safe language. However, for Java to be broadly useful, it needs additional expressive power. This pape...
Andrew C. Myers, Joseph A. Bank, Barbara Liskov
EDM
2010
140views Data Mining» more  EDM 2010»
15 years 7 months ago
Assessing Reviewer's Performance Based on Mining Problem Localization in Peer-Review Data
Current peer-review software lacks intelligence for responding to students' reviewing performance. As an example of an additional intelligent assessment component to such soft...
Wenting Xiong, Diane J. Litman, Christian D. Schun...