Sciweavers

COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 10 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
DAM
2008
135views more  DAM 2008»
13 years 11 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
CASCON
1994
123views Education» more  CASCON 1994»
14 years 5 days ago
Integrating real-time and partial-order information in event-data displays
The events occurring in the execution of a distributed or parallel application are related by a partial, rather than a total, order. We have developed prototype software that coll...
David J. Taylor, Michael H. Coffin
NIPS
2008
14 years 8 days ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
DEBS
2007
ACM
14 years 19 days ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
LICS
1991
IEEE
14 years 2 months ago
Defaults and Revision in Structured Theories
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
Mark Ryan
APN
2001
Springer
14 years 2 months ago
Partial Order Verification of Programmable Logic Controllers
We address the verification of programmable logic controllers (PLC). In our approach, a PLC program is translated into a special type of colored Petri net, a so-called register net...
Peter Deussen
ICPP
1999
IEEE
14 years 3 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
CP
2001
Springer
14 years 3 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
14 years 3 months ago
Qualitative diagnosability of labeled petri nets revisited
Abstract— In recent years, classical discrete event fault diagnosis techniques have been extended to Petri Net system models under partial order semantics [8], [9], [13]. In [14]...
Stefan Haar