Sciweavers

1160 search results - page 83 / 232
» Revisiting the Sequence Constraint
Sort
View
MINENET
2005
ACM
15 years 12 months ago
Topographical proximity for mining network alarm data
Increasingly powerful fault management systems are required to ensure robustness and quality of service in today’s networks. In this context, event correlation is of prime impor...
Ann Devitt, Joseph Duffin, Robert Moloney
MICRO
1993
IEEE
131views Hardware» more  MICRO 1993»
15 years 10 months ago
Superblock formation using static program analysis
Compile-time code transformations which expose instruction-level parallelism (ILP) typically take into account the constraints imposed by all execution scenarios in the program. H...
Richard E. Hank, Scott A. Mahlke, Roger A. Bringma...
ENTCS
2008
120views more  ENTCS 2008»
15 years 6 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
CORR
2007
Springer
92views Education» more  CORR 2007»
15 years 6 months ago
CD(4) has bounded width
We prove that the constraint languages invariant under a short sequence of J´onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they h...
Catarina Carvalho, Víctor Dalmau, Petar Mar...
COCOON
2009
Springer
16 years 27 days ago
On Smoothed Analysis of Quicksort and Hoare's Find
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Ni...