Sciweavers

1945 search results - page 53 / 389
» Speeding up Serpent
Sort
View
GLOBECOM
2010
IEEE
14 years 9 months ago
Independent Parallel Compact Finite Automatons for Accelerating Multi-String Matching
Multi-string matching is a key technique for implementing network security applications like Network Intrusion Detection Systems (NIDS) and anti-virus scanners. Existing DFA-based ...
Yi Tang, Junchen Jiang, Xiaofei Wang, Bin Liu, Yan...
QEST
2010
IEEE
14 years 9 months ago
Rare Event Simulation for Highly Dependable Systems with Fast Repairs
Stochastic model checking has been used recently to assess, among others, dependability measures for a variety of systems. However, the employed numerical methods, as, e.g., suppor...
Daniël Reijsbergen, Pieter-Tjerk de Boer, Wer...
95
Voted
ICALP
2009
Springer
15 years 11 months ago
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Ka...
NJC
2000
99views more  NJC 2000»
14 years 11 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
ISCI
1998
193views more  ISCI 1998»
14 years 10 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza