Výsledky vyhledávání - "Slavici, Vlad"

Report

Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks

Autor: Slavici, Vlad, Kunkle, Daniel, Cooperman, Gene, Linton, Stephen

Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA), and then the productio

Externí odkaz: http://arxiv.org/abs/1103.5736

Zobrazit plný text záznamu

Conference

Adapting Irregular Computations to Large CPU-GPU Clusters in the MADNESS Framework.

Autor: Slavici, Vlad, Varier, Raghu, Cooperman, Gene, Harrison, Robert J.

Publikováno v: 2012 IEEE International Conference on Cluster Computing; 1/ 1/2012, p1-9, 9p

Zobrazit plný text záznamu

Conference

Fast multiplication of large permutations for disk, flash memory and RAM.

Autor: Slavici, Vlad, Dong, Xin, Kunkle, Daniel, Cooperman, Gene

Publikováno v: Proceedings of the 2010 International Symposium: Symbolic & Algebraic Computation; 7/25/2010, p355-362, 8p

Zobrazit plný text záznamu

Conference

Parallel disk-based computation for large, monolithic binary decision diagrams.

Autor: Kunkle, Daniel, Slavici, Vlad, Cooperman, Gene

Publikováno v: Proceedings of the 4th International Workshop: Parallel & Symbolic Computation; 7/21/2010, p63-72, 10p

Zobrazit plný text záznamu