Sciweavers

1883 search results - page 179 / 377
» Ordered theta graphs
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 8 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
ORDER
2008
61views more  ORDER 2008»
13 years 8 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
CDC
2008
IEEE
192views Control Systems» more  CDC 2008»
13 years 10 months ago
Distributed coordination algorithms for multiple fractional-order systems
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
Yongcan Cao, Yan Li, Wei Ren, Yangquan Chen
STACS
1991
Springer
13 years 11 months ago
The RELVIEW-System
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
Rudolf Berghammer, Gunther Schmidt
AIML
2008
13 years 9 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto