Sciweavers

688 search results - page 92 / 138
» The Flow Set with Partial Order
Sort
View
CAISE
1999
Springer
15 years 2 months ago
Towards a Classification Framework for Application Granularity in Workflow Management Systems
The support of process enactment through the use of workflow management systems has gained considerable attention within the last few years. We develop a classification framework c...
Jörg Becker, Michael zur Muehlen
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 4 days ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
ECAI
2004
Springer
15 years 3 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
15 years 1 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
Panagiotis Manolios, Sudarshan K. Srinivasan
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa