The problem of assigning structural properties of a linear system through sensor selection is, for a given pair (A, B), to find an output pair (C, D) such that the resulting syst...
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...