Sciweavers

937 search results - page 18 / 188
» On the Complexity of Partial Order Properties
Sort
View
LOGCOM
2007
92views more  LOGCOM 2007»
14 years 9 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
AGP
2003
IEEE
15 years 3 months ago
Ordered Programs as Abductive Systems
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
Davy Van Nieuwenborgh, Dirk Vermeir
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 2 months ago
A poset framework to model decentralized control problems
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
Parikshit Shah, Pablo A. Parrilo
DCC
2008
IEEE
15 years 9 months ago
An improved list decoding algorithm for the second order Reed-Muller codes and its applications
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
Rafaël Fourquet, Cédric Tavernier
IPPS
2000
IEEE
15 years 2 months ago
Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
Andreas C. Döring, Gunther Lustig