Sciweavers

8132 search results - page 174 / 1627
» Dependability, Abstraction, and Programming
Sort
View
LRE
2010
145views more  LRE 2010»
15 years 1 months ago
Annotation of multiword expressions in the Prague dependency treebank
In this article we want to demonstrate that annotation of multiword expressions in the Prague Dependency Treebank is a well defined task, that it is useful as well as feasible, an...
Eduard Bejcek, Pavel Stranák
CP
2009
Springer
16 years 7 months ago
Maintaining State in Propagation Solvers
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
Raphael M. Reischuk, Christian Schulte, Peter J. S...
CISIS
2010
IEEE
16 years 1 months ago
Extending Security-by-Contract with Quantitative Trust on Mobile Devices
Abstract—Security-by-Contract (S×C) is a paradigm providing security assurances for mobile applications. In this work, we present an extension of S×C enriched with an automatic...
Gabriele Costa, Nicola Dragoni, Aliaksandr Lazousk...
PVM
2009
Springer
16 years 1 months ago
Optimizing MPI Runtime Parameter Settings by Using Machine Learning
Abstract. Manually tuning MPI runtime parameters is a practice commonly employed to optimise MPI application performance on a specific architecture. However, the best setting for ...
Simone Pellegrini, Jie Wang, Thomas Fahringer, Han...
CC
2005
Springer
115views System Software» more  CC 2005»
16 years 2 days ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...