The Monte Carlo EM method for the parameter estimation of biological models Fulltext Access 14 Pages 2011
Expressive Completeness for LTL With Modulo Counting and Group Quantifiers Fulltext Access 14 Pages 2011
Nested Lambda Expressions with Let Expressions in C++ Template Metaprograms Fulltext Access 14 Pages 2011
An Ontology-driven Document Retrieval Strategy for Organizational Knowledge Management Systems Fulltext Access 14 Pages 2011
A Model Driven Approach to the Analysis of Quality Scenarios within Self-Adaptable SOA Systems Fulltext Access 14 Pages 2011
Some structural properties of minimally contraction-critically 5-connected graphs Fulltext Access 14 Pages 2011
A continuous extension of a q-analogue of the 9-j symbols and its orthogonality Fulltext Access 14 Pages 2011
On the approximability of the minimum strictly fundamental cycle basis problem Fulltext Access 14 Pages 2011
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges Fulltext Access 14 Pages 2011
The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm Fulltext Access 14 Pages 2011
On the expressive power of CNF formulas of bounded tree- and clique-width Fulltext Access 14 Pages 2011
Static Resource Analysis for Java Bytecode Using Amortisation and Separation Logic Fulltext Access 14 Pages 2011
Complete and Platform-Independent Calling Context Profiling for the Java Virtual Machine Fulltext Access 14 Pages 2011
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi Fulltext Access 14 Pages 2011
The group structure of pivot and loop complementation on graphs and set systems Fulltext Access 15 Pages 2011
Orientable embeddings and orientable cycle double covers of projective-planar graphs Fulltext Access 15 Pages 2011
Classification of nonorientable regular embeddings of complete bipartite graphs Fulltext Access 15 Pages 2011
Strictly monotonic multidimensional sequences and stable sets in pillage games Fulltext Access 15 Pages 2011
ENT: A Generic Meta-Model for the Description of Component-Based Applications Fulltext Access 15 Pages 2011
Combining Proof and Model-checking to Validate Reconfigurable Architectures Fulltext Access 15 Pages 2011
Enhanced Type-based Component Compatibility Using Deployment Context Information Fulltext Access 15 Pages 2011
A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains Fulltext Access 15 Pages 2011
Deconstructing intractability—A multivariate complexity analysis of interval constrained coloring Fulltext Access 15 Pages 2011
The minimum spanning tree problem with conflict constraints and its variations Fulltext Access 15 Pages 2011
Paths of bounded length and their cuts: Parameterized complexity and algorithms Fulltext Access 15 Pages 2011
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices Fulltext Access 15 Pages 2011
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem Fulltext Access 15 Pages 2011
The number of vertices of degree 5 in a contraction-critically 5-connected graph Fulltext Access 15 Pages 2011