Sciweavers

1523 search results - page 42 / 305
» Partially ordered secretaries
Sort
View
136
Voted
ACSD
2007
IEEE
140views Hardware» more  ACSD 2007»
15 years 4 months ago
Synthesis of Petri Nets from Finite Partial Languages
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
Robert Lorenz, Robin Bergenthum, Jörg Desel, ...
121
Voted
CMS
2006
150views Communications» more  CMS 2006»
15 years 1 months ago
Attribute Delegation Based on Ontologies and Context Information
This paper presents a model for delegation based on partial orders, proposing the subclass relation in OWL as a way to represent the partial orders. Delegation and authorization de...
Isaac Agudo, Javier Lopez, José A. Monteneg...
99
Voted
ORDER
2006
105views more  ORDER 2006»
15 years 14 days ago
Descending Chains and Antichains of the Unary, Linear, and Monotone Subfunction Relations
The C-subfunction relations on the set of functions on a finite base set A defined by function classes C are examined. For certain clones C on A, it is determined whether the part...
Erkko Lehtonen
97
Voted
ISMB
1994
15 years 1 months ago
Using Interval Logic for Order Assembly
Temporallogic, in particular, interval logic has been used to represent genomemapsand to assist genome mapconstructions. However,interval logic itself appears to be bruited in its...
Zhan Cui
103
Voted
ISSAC
2009
Springer
167views Mathematics» more  ISSAC 2009»
15 years 7 months ago
High order derivatives and decomposition of multivariate polynomials
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
Jean-Charles Faugère, Ludovic Perret