896 search results - page 136 / 180 » On completeness of word reversing |
ENDM
2008
13 years 8 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
ERCIM
2008
13 years 8 months ago
2008
Information and Communication Technologies facilitate the emergence of new contexts and practices of learning that educational institutions have to adapt to their pedagogical disc...
AUTOMATICA
2006
13 years 8 months ago
2006
The problem of absolute stability is one of the oldest open problems in the theory of control. Even for the particular case of second-order systems a complete solution was present...
CN
2006
13 years 8 months ago
2006
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
COR
2006
13 years 8 months ago
2006
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...