Sciweavers

413 search results - page 77 / 83
» An abstract Monte-Carlo method for the analysis of probabili...
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 8 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
STACS
2005
Springer
14 years 2 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
ECOOP
2001
Springer
14 years 1 months ago
Feature Interaction and Composition Problems in Software Product Lines
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
Silva Robak, Bogdan Franczyk
SIGSOFT
2006
ACM
14 years 9 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
IFIP
2009
Springer
14 years 3 months ago
Contextual Inquiry in Signal Boxes of a Railway Organization
A number of selected field-study techniques have been validated in a case study in the domain of railway signal boxes. The context of this work is the endeavour of a human-centred ...
Joke Van Kerckhoven, Sabine Geldof, Bart Vermeersc...