Sciweavers

3131 search results - page 330 / 627
» Generalized connection caching
Sort
View
DM
2008
125views more  DM 2008»
15 years 6 months ago
Difference systems of sets and cyclotomy
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
Yukiyasu Mutoh, Vladimir D. Tonchev
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
EJC
2008
15 years 6 months ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
ENTCS
2008
102views more  ENTCS 2008»
15 years 6 months ago
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...
Alexander Kurz, Daniela Petrisan
CCR
2006
136views more  CCR 2006»
15 years 6 months ago
Traffic classification on the fly
The early detection of applications associated with TCP flows is an essential step for network security and traffic engineering. The classic way to identify flows, i.e. looking at...
Laurent Bernaille, Renata Teixeira, Ismael Akodken...