ASM refinement and generalizations of forward simulation in data refinement: a comparison Fulltext Access 33 Pages 2005
A partial order semantics approach to the clock explosion problem of timed automata Fulltext Access 33 Pages 2005
Quantum and classical complexity classes: Separations, collapses, and closure properties Fulltext Access 34 Pages 2005
Temporal stratification tests for linear and branching-time deductive databases Fulltext Access 34 Pages 2005
XML stream transformer generation through program composition and dependency analysis Fulltext Access 34 Pages 2005
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results Fulltext Access 34 Pages 2005
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability Fulltext Access 34 Pages 2005
A discrete-time UML semantics for concurrency and communication in safety-critical applications Fulltext Access 35 Pages 2005
A symbolic decision procedure for cryptographic protocols with time stamps Fulltext Access 35 Pages 2005
Minimizing the total completion time on-line on a single machine, using restarts Fulltext Access 35 Pages 2005
Convergence results for the (1,λ)-SA-ES using the theory of Ï-irreducible Markov chains Fulltext Access 35 Pages 2005
Heterogeneous Reasoning with Euler/Venn Diagrams Containing Named Constants and FOL Fulltext Access 35 Pages 2005
General constructions for information-theoretic private information retrieval Fulltext Access 35 Pages 2005
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon Fulltext Access 35 Pages 2005
The existential theory of equations with rational constraints in free groups is PSPACE-complete Fulltext Access 36 Pages 2005
A static analysis of cryptographic processes: the denotational approach Fulltext Access 36 Pages 2005
Semiotic schemas: A framework for grounding language in action and perception Fulltext Access 36 Pages 2005
Attribute grammars for unranked trees as a query language for structured documents Fulltext Access 37 Pages 2005
From Hopfield nets to recursive networks to graph machines: Numerical machine learning for structured data Fulltext Access 37 Pages 2005
Sequential and indexed two-dimensional combinatorial template matching allowing rotations Fulltext Access 37 Pages 2005
The emergence of compositional structures in perceptually grounded language games Fulltext Access 37 Pages 2005
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint Fulltext Access 37 Pages 2005
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems Fulltext Access 38 Pages 2005
Static insertion of safe and effective memory reuse commands into ML-like programs Fulltext Access 38 Pages 2005
An “abstract process” approach to algebraic dynamic architecture description Fulltext Access 38 Pages 2005
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing Fulltext Access 39 Pages 2005
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming Fulltext Access 39 Pages 2005
A logic-based model of intention formation and action for multi-agent subcontracting Fulltext Access 39 Pages 2005
Partition-based logical reasoning for first-order and propositional theories Fulltext Access 40 Pages 2005
Decomposition orders-another generalisation of the fundamental theorem of arithmetic Fulltext Access 40 Pages 2005
Dynamically structuring, updating and interrelating representations of visual and linguistic discourse context Fulltext Access 41 Pages 2005
Coalgebraic minimization of HD-automata for the Ï-calculus using polymorphic types Fulltext Access 41 Pages 2005
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations Fulltext Access 41 Pages 2005