Sciweavers

ORDER
2010
110views more  ORDER 2010»
13 years 10 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
RSA
2008
85views more  RSA 2008»
13 years 11 months ago
On a universal best choice algorithm for partially ordered sets
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
Nicholas Georgiou, Malgorzata Kuchta, Michal Moray...
ORDER
2007
95views more  ORDER 2007»
13 years 11 months ago
A Half-Space Approach to Order Dimension
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to the dimens...
Stephan Foldes, Jenö Szigeti
DM
2006
135views more  DM 2006»
13 years 12 months ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman
EJC
2008
13 years 12 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen
DAGSTUHL
2006
14 years 1 months ago
Enriched categories and models for spaces of dipaths
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
Timothy Porter
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
14 years 1 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
CAV
1998
Springer
98views Hardware» more  CAV 1998»
14 years 4 months ago
Verification of Timed Systems Using POSETs
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Wendy Belluomini, Chris J. Myers
ACMMPC
2000
Springer
231views Mathematics» more  ACMMPC 2000»
14 years 4 months ago
Galois Connections and Fixed Point Calculus
Fixed point calculus is about the solution of recursive equations de˛ned by a monotonic endofunction on a partially ordered set. This tutorial presents the basic theory of ˛xed ...
Roland Carl Backhouse
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 4 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