219 search results - page 35 / 44 » Combinatorial Complexity of Regular Languages |
SSIRI
2010
14 years 8 months ago
2010
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
DATE
2006
IEEE
15 years 4 months ago
2006
IEEE
With the increasing complexity and heterogeneity of embedded electronic systems, a unified design methodology at evels of abstraction becomes a necessity. Meanwhile, it is also i...
130
click to vote
HPDC
1993
IEEE
1993
IEEE
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
15 years 2 months ago
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
NIPS
2001
14 years 11 months ago
2001
We introduce a new type of Self-Organizing Map (SOM) to navigate in the Semantic Space of large text collections. We propose a "hyperbolic SOM" (HSOM) based on a regular...
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...