Sciweavers

1920 search results - page 48 / 384
» The Complexity of the A B C Problem
Sort
View
AUTOMATICA
2007
62views more  AUTOMATICA 2007»
15 years 6 months ago
Further results on structural assignment of linear systems via sensor selection
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...
Xinmin Liu, Zongli Lin, Ben M. Chen
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 7 months ago
Approximate dynamic programming for rail operations
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...
Warren B. Powell, Belgacem Bouzaïene-Ayari
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
16 years 16 days ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
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...
Stefan Kratsch, Frank Neumann
PVLDB
2008
123views more  PVLDB 2008»
15 years 5 months ago
Propagating functional dependencies with conditions
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...
CCCG
2010
15 years 7 months ago
I/O-efficient triangular range search and its application
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...
Gautam K. Das, Bradford G. Nickerson