1000 search results - page 112 / 200 » Dependency Tree Automata |
100
Voted
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
106
click to vote
DSD
2005
IEEE
15 years 2 months ago
2005
IEEE
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
AAAI
1996
15 years 2 months ago
1996
Agents that operate in a multi-agent system need an efficient strategy to handle their encounters with other agents involved. Searching for an optimal interactive strategy is a ha...
124
Voted
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
109
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...