1728 search results - page 56 / 346 » The Size of Power Automata |
ALIFE
2010
15 years 7 hour ago
2010
Edgar Codd's 1968 design for a self-replicating cellular automata machine has never been implemented. Partly this is due to its enormous size but we have also identified four...
119
click to vote
ANCS
2009
ACM
14 years 9 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
MLG
2007
Springer
15 years 6 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
78
Voted
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
As power system loading increases, larger blackouts due to cascading outages become more likely. We investigate a critical loading at which the average size of blackouts increases...
DATE
2000
IEEE
15 years 4 months ago
2000
IEEE
We present a technique for fast estimation of the power consumed by the cache and bus sub-system of a parameterized system-on-a-chip design for a given application. The technique ...