9 search results - page 1 / 2 » Memory-Efficient Regular Expression Search Using State Mergi... |
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
CPM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
AIPS
2011
13 years 1 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...