3818 search results - page 249 / 764 » Word Problems on Compressed Words |
147
click to vote
ENTCS
2006
15 years 6 months ago
2006
Working with models often requires the ability to assert the compliance of a given model to a given set of constraints. Some tools are able to check OCL invariants on UML models. ...
195
click to vote
ENTCS
2006
15 years 6 months ago
2006
In this paper, we are motivated by the problem of semantic web services composition. We first present a typical example requiring services composition, give a definition of an aut...
165
click to vote
GC
2006
Springer
15 years 6 months ago
2006
Springer
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
151
click to vote
IPL
2008
15 years 6 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
160
click to vote
IJHPCA
2006
15 years 6 months ago
2006
The ability of performance technology to keep pace with the growing complexity of parallel and distributed systems depends on robust performance frameworks that can at once provid...