Sciweavers

3415 search results - page 380 / 683
» Lower bounds on kernelization
Sort
View
LMCS
2007
132views more  LMCS 2007»
15 years 6 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
ENDM
2002
86views more  ENDM 2002»
15 years 6 months ago
Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
Stanislav Jendrol, Heinz-Jürgen Voss
EMSOFT
2004
Springer
16 years 1 days ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
DAC
2009
ACM
16 years 7 months ago
Mode grouping for more effective generalized scheduling of dynamic dataflow applications
For a number of years, dataflow concepts have provided designers of digital signal processing systems with environments capable of expressing high-level software architectures as ...
William Plishker, Nimish Sane, Shuvra S. Bhattacha...
SIGCOMM
2009
ACM
16 years 1 months ago
Passive aggressive measurement with MGRP
We present the Measurement Manager Protocol (MGRP), an in-kernel service that schedules and transmits probes on behalf of active measurement tools. Unlike prior measurement servic...
Pavlos Papageorge, Justin McCann, Michael Hicks