We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
We introduce a novel way of measuring the entropy of a set of values undergoing changes. Such a measure becomes useful when analyzing the temporal development of an algorithm desi...
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Abstract: Knowledge management is characterized by many different activities ranging from the elicitation of knowledge to its storing, sharing, maintenance, usage and creation. Sk...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...