Evaluating Sets of Search Points Using Relational Algebra
From MaRDI portal
Publication:5459187
DOI10.1007/11828563_18zbMath1134.68497OpenAlexW2158611331MaRDI QIDQ5459187
Publication date: 24 April 2008
Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11828563_18
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items (8)
Relation-algebraic specification and solution of special university timetabling problems ⋮ Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ Relation Algebra and RelView in Practical Use: Construction of Special University Timetables ⋮ Multi-objective Problems in Terms of Relational Algebra ⋮ A general method for representing sets of relations by vectors ⋮ Relational computation of sets of relations ⋮ Relational Construction of Specific Timetables ⋮ State space analysis of Petri nets with relation-algebraic methods
This page was built for publication: Evaluating Sets of Search Points Using Relational Algebra
