Sciweavers

2356 search results - page 113 / 472
» Characterizations of postman sets
Sort
View
CCIA
2009
Springer
15 years 5 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo
COLOGNETWENTE
2009
15 years 5 months ago
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
Stavros D. Nikolopoulos, Charis Papadopoulos
SIGMETRICS
2010
ACM
203views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
An analytical framework to infer multihop path reliability in MANETs
Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
Nelson Antunes, Gonçalo Jacinto, Antó...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 4 months ago
Directive words of episturmian words: equivalences and normalization
Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. ...
Amy Glen, Florence Levé, Gwénaë...
JISE
2006
76views more  JISE 2006»
15 years 4 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma