Compactly representing utility functions using weighted goals and the max aggregator Fulltext Access 25 Pages 2010
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies Fulltext Access 25 Pages 2010
Using Assertions to Enhance the Correctness of Kmelia Components and their Assemblies Fulltext Access 26 Pages 2010
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol Fulltext Access 26 Pages 2010
The dependence condition graph: Precise conditions for dependence between program points Fulltext Access 26 Pages 2010
A ‘context-aware’ and agent-centric perspective for the alignment between individuals and organizations Fulltext Access 26 Pages 2010
The complexity of flow on fat terrains and its i/o-efficient computation Fulltext Access 26 Pages 2010
Anonymization of moving objects databases by clustering and perturbation Fulltext Access 27 Pages 2010
Aspects of availability: Enforcing timed properties to prevent denial of service Fulltext Access 27 Pages 2010
Model Checking of Component Protocol Conformance – Optimizations by Reducing False Negatives Fulltext Access 28 Pages 2010
Bounded treewidth as a key to tractability of knowledge representation and reasoning Fulltext Access 28 Pages 2010
Using abstract interpretation to add type checking for interfaces in Java bytecode verification Fulltext Access 28 Pages 2010
On the power of structural decompositions of graph-based representations of constraint problems Fulltext Access 28 Pages 2010
An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications Fulltext Access 28 Pages 2010
Type-directed weaving of aspects for polymorphically typed functional languages Fulltext Access 29 Pages 2010
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms Fulltext Access 29 Pages 2010
Defeasible inheritance with doubt index and its axiomatic characterization Fulltext Access 29 Pages 2010
Learning complex action models with quantifiers and logical implications Fulltext Access 30 Pages 2010
Characterizing and proving operational termination of deterministic conditional term rewriting systems Fulltext Access 30 Pages 2010
Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition Fulltext Access 30 Pages 2010
Engineering constraint solvers for automatic analysis of probabilistic hybrid automata Fulltext Access 31 Pages 2010
Democratic instance selection: A linear complexity instance selection algorithm based on classifier ensemble concepts Fulltext Access 32 Pages 2010
An AGM-style belief revision mechanism for probabilistic spatio-temporal logics Fulltext Access 33 Pages 2010
Eager and delayed contract monitoring for call-by-value and call-by-name evaluation Fulltext Access 35 Pages 2010
Ontology-driven analysis of UML-based collaborative processes using OWL-DL and CPN Fulltext Access 35 Pages 2010
Aspect-oriented model-driven skeleton code generation: A graph-based transformation approach Fulltext Access 37 Pages 2010
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution Fulltext Access 37 Pages 2010
On-demand strategy annotations revisited: An improved on-demand evaluation strategy Fulltext Access 38 Pages 2010