Sciweavers

595 search results - page 27 / 119
» Languages Of Analogical Strings
Sort
View
DLT
2006
14 years 11 months ago
Bag Context Tree Grammars
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during ...
Frank Drewes, Christine du Toit, Sigrid Ewert, Bri...
51
Voted
ICSE
2009
IEEE-ACM
15 years 10 months ago
TranStrL: An automatic need-to-translate string locator for software internationalization
Software internationalization is often necessary when distributing software applications to different regions around the world. In many cases, developers often do not internationa...
Xiaoyin Wang, Lu Zhang, Tao Xie, Hong Mei, Jiasu S...
70
Voted
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
14 years 10 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
15 years 7 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
14 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro