Sciweavers

162 search results - page 18 / 33
» Programming with characters
Sort
View
FPL
2008
Springer
178views Hardware» more  FPL 2008»
13 years 10 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...
MOC
2000
71views more  MOC 2000»
13 years 8 months ago
Zeroes of Dirichlet L-functions and irregularities in the distribution of primes
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
Carter Bays, Richard H. Hudson
ENTCS
2006
184views more  ENTCS 2006»
13 years 8 months ago
Scannerless Boolean Parsing
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
Adam Megacz
ISSRE
2002
IEEE
14 years 1 months ago
Mutation of Java Objects
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
Roger T. Alexander, James M. Bieman, Sudipto Ghosh...
CAINE
2001
13 years 10 months ago
Intelligent Network Control Using Object-Oriented Term-Rewriting
In this paper, we describe the theoretical framework that allows us to use of the expert system shell CLIPS to define the network model in the Distribution Management System (DMS)...
Adam Steele