Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
— A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indi...
Nikolay N. Ponomarenko, Vladimir V. Lukin, Karen O...
Abstract. Inputs to web forms often contain typos or other errors. However, existing web form design tools require end-user developers to write regular expressions (“regexps”) ...
Described are new approaches for evaluating computer program representations for use in automated search methodologies such as the evolutionary design of software. Previously, prog...