414 search results - page 38 / 83 » On discrete norms of polynomials |
MOC
2010
13 years 4 months ago
2010
Hill's method is a means to numerically approximate spectra of linear differential operators with periodic coefficients. In this paper, we address different issues related to...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
ORL
2007
13 years 9 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
NETWORKS
2011
13 years 4 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
HYBRID
2007
Springer
14 years 1 months ago
2007
Springer
Multiple-pursuer multiple-evader games raise fundamental and novel problems in control theory and robotics. In this paper, we propose a distributed solution to this problem that si...