Sciweavers

425 search results - page 6 / 85
» Homothetic interval orders
Sort
View
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 11 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
GLVLSI
1998
IEEE
119views VLSI» more  GLVLSI 1998»
14 years 3 months ago
A Combined Interval and Floating Point Multiplier
Interval arithmetic provides an e cient method for monitoring and controlling errors in numerical calculations. However, existing software packages for interval arithmetic are oft...
James E. Stine, Michael J. Schulte
FCT
2009
Springer
14 years 5 months ago
Closure Operators for Order Structures
We argue that closure operators are fundamental tools for the study of relationships between order structures and their sequence representations. We also propose and analyse a clos...
Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova
CVPR
2004
IEEE
15 years 26 days ago
Propagation Networks for Recognition of Partially Ordered Sequential Action
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...
Yifan Shi, Yan Huang, David Minnen, Aaron F. Bobic...
ENTCS
2002
103views more  ENTCS 2002»
13 years 10 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer