Formal Relationships Between Geometrical and Classical Models for Concurrency Fulltext Access 33 Pages 2012
A centralized and a decentralized method to automatically derive choreography-conforming web service systems Fulltext Access 33 Pages 2012
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata Fulltext Access 34 Pages 2012
BabelNet: The automatic construction, evaluation and application of a wide-coverage multilingual semantic network Fulltext Access 34 Pages 2012
GAMoN: Discovering M-of-N{¬,∨} hypotheses for text classification by a lattice-based Genetic Algorithm Fulltext Access 35 Pages 2012
Failure-divergence semantics and refinement of long running transactions Fulltext Access 35 Pages 2012
On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories Fulltext Access 35 Pages 2012
A formal approach to the specification and transformation of constraints in MDE Fulltext Access 36 Pages 2012
Formalization and correctness of the PALS architectural pattern for distributed real-time systems Fulltext Access 37 Pages 2012
Towards fixed-parameter tractable algorithms for abstract argumentation Fulltext Access 37 Pages 2012
Verifying hierarchical Ptolemy II discrete-event models using Real-Time Maude Fulltext Access 37 Pages 2012
An efficient and versatile approach to trust and reputation using hierarchical Bayesian modelling Fulltext Access 37 Pages 2012
Importance sampling-based estimation over AND/OR search spaces for graphical models Fulltext Access 40 Pages 2012
Towards more expressive ontology languages: The query answering problem Fulltext Access 42 Pages 2012
Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder Fulltext Access 46 Pages 2012
The implication problem for ‘closest node’ functional dependencies in complete XML documents Fulltext Access 54 Pages 2012
A note on approximating the min–max vertex disjoint paths on directed acyclic graphs Fulltext Access 4 Pages 2011
Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices Fulltext Access 4 Pages 2011
Analytically exact spiral scheme for generating uniformly distributed points on the unit sphere Fulltext Access 4 Pages 2011
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem' Fulltext Access 4 Pages 2011
Settling the bound on the rectilinear link radius of a simple rectilinear polygon Fulltext Access 4 Pages 2011
Proportionate flowshops with general position-dependent processing times Fulltext Access 4 Pages 2011
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs Fulltext Access 4 Pages 2011
Minterm-transitive functions with asymptotically smallest block sensitivity Fulltext Access 4 Pages 2011
A simple OPT+1OPT+1 algorithm for cutting stock under the modified integer round-up property assumption Fulltext Access 4 Pages 2011
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem Fulltext Access 4 Pages 2011
Cryptanalysis of an identity based broadcast encryption scheme without random oracles Fulltext Access 4 Pages 2011
Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m2)GF(2m) using all one polynomial Fulltext Access 4 Pages 2011
Low-interference networks in metric spaces of bounded doubling dimension Fulltext Access 4 Pages 2011
A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs Fulltext Access 4 Pages 2011
Security enhancement on an improvement on two remote user authentication schemes using smart cards Fulltext Access 4 Pages 2011
GriF: A new collaborative framework for a web service approach to grid empowered calculations Fulltext Access 4 Pages 2011
Erratum and addendum to “A linear time algorithm for finding all hinge vertices of a permutation graph” [Information Processing Letters 59 (2) (1996) 103–107] Fulltext Access 4 Pages 2011
Comments on “Generalized rate monotonic schedulability bounds using relative period ratios” Fulltext Access 4 Pages 2011
On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász Local Lemma Fulltext Access 4 Pages 2011
On the average cost of order-preserving encryption based on hypergeometric distribution Fulltext Access 4 Pages 2011
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions Fulltext Access 4 Pages 2011
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs Fulltext Access 4 Pages 2011
Improved approximation algorithms for minimum AND-circuits problem via k-set cover Fulltext Access 4 Pages 2011