Sciweavers

5639 search results - page 495 / 1128
» Timed Abstract Non-interference
Sort
View
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
15 years 11 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
ESWS
2009
Springer
15 years 11 months ago
Who the Heck Is the Father of Bob?
Abstract. Finding the optimal selection of an OWL reasoner and service interface for a specific ontology-based application is challenging. Over time it has become more and more di...
Marko Luther, Thorsten Liebig, Sebastian Böhm...
EUROPAR
2009
Springer
15 years 11 months ago
Steady-State for Batches of Identical Task Trees
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
Sékou Diakité, Loris Marchal, Jean-M...
EUROPAR
2009
Springer
15 years 11 months ago
Scalable Transactions for Web Applications in the Cloud
Abstract. Cloud computing platforms provide scalability and high availability properties for web applications but they sacrifice data consistency at the same time. However, many a...
Zhou Wei, Guillaume Pierre, Chi-Hung Chi
FMCAD
2009
Springer
15 years 11 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...