Sciweavers

2467 search results - page 181 / 494
» Finite State Machines
Sort
View
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
15 years 5 months ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
IWMM
2010
Springer
118views Hardware» more  IWMM 2010»
15 years 11 months ago
Speculative parallelization using state separation and multiple value prediction
With the availability of chip multiprocessor (CMP) and simultaneous multithreading (SMT) machines, extracting thread level parallelism from a sequential program has become crucial...
Chen Tian, Min Feng, Rajiv Gupta
ICC
2011
IEEE
237views Communications» more  ICC 2011»
14 years 6 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
ICCAD
2001
IEEE
89views Hardware» more  ICCAD 2001»
16 years 3 months ago
Sequential SPFDs
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
Subarnarekha Sinha, Andreas Kuehlmann, Robert K. B...
ICML
2010
IEEE
15 years 7 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...