Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) Fulltext Access 36 Pages 2007
Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments Fulltext Access 36 Pages 2007
Customizing an XML–Haskell data binding with type isomorphism inference in Generic Haskell Fulltext Access 36 Pages 2007
Instruction-level security analysis for information flow in stack-based assembly languages Fulltext Access 37 Pages 2007
Using semi-formal methods for detecting interactions among smart homes policies Fulltext Access 37 Pages 2007
Contextualization as an independent abstraction mechanism for conceptual modeling Fulltext Access 37 Pages 2007
Partially observable Markov decision processes with imprecise parameters Fulltext Access 38 Pages 2007
Combining Description Logics with synopses for inferring complex knowledge patterns from XML sources Fulltext Access 41 Pages 2007
Conservation principles and action schemes in the synthesis of geometric concepts Fulltext Access 42 Pages 2007
Intruder deduction for the equational theory of Abelian groups with distributive encryption Fulltext Access 43 Pages 2007
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic Fulltext Access 43 Pages 2007
The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems Fulltext Access 44 Pages 2007
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory Fulltext Access 69 Pages 2007
An approximation algorithm for interval data minmax regret combinatorial optimization problems Fulltext Access 4 Pages 2006
Variations of the maximum leaf spanning tree problem for bipartite graphs Fulltext Access 4 Pages 2006
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes Fulltext Access 4 Pages 2006
Introduction to the special issue on software analysis, evolution and reengineering Fulltext Access 4 Pages 2006
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs Fulltext Access 4 Pages 2006
An ss-strong tournament with s⩾3s⩾3 has s+1s+1 vertices whose out-arcs are 4-pancyclic Fulltext Access 4 Pages 2006
A new algorithm for online uniform-machine scheduling to minimize the makespan Fulltext Access 4 Pages 2006
Propositional dynamic logic of context-free programs and fixpoint logic with chop Fulltext Access 4 Pages 2006
Fast generators for the Diffie–Hellman key agreement protocol and malicious standards Fulltext Access 4 Pages 2006
Improved constructions of secret sharing schemes by applying (λ,ω)-decompositions Fulltext Access 4 Pages 2006
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect Fulltext Access 4 Pages 2006