397 search results - page 33 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
JSAC
2006
13 years 7 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
GECCO
2003
Springer
14 years 25 days ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
SIAMCO
2008
13 years 7 months ago
2008
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...