Sciweavers

101 search results - page 11 / 21
» General Algorithms for Testing the Ambiguity of Finite Autom...
Sort
View
SIGCOMM
2006
ACM
14 years 2 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
FOCS
1998
IEEE
14 years 20 days ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
ICFP
2006
ACM
14 years 8 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
GECCO
2007
Springer
217views Optimization» more  GECCO 2007»
13 years 10 months ago
A quantitative analysis of memory requirement and generalization performance for robotic tasks
In autonomous agent systems, memory is an important element to handle agent behaviors appropriately. We present the analysis of memory requirements for robotic tasks including wal...
DaeEun Kim
FAC
2008
64views more  FAC 2008»
13 years 8 months ago
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...
Robert M. Hierons, Florentin Ipate