Sciweavers

995 search results - page 48 / 199
» complexity 2011
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
On the instantaneous frequency smoothing for signals with quasi-linear frequency changes
The problem of estimation of the slowly-varying instantaneous frequency of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved ...
Maciej Niedzwiecki, Michal Stanislaw Meller
236
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
122
Voted
ECCC
2011
217views ECommerce» more  ECCC 2011»
14 years 6 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....
132
Voted
EVOW
2011
Springer
14 years 6 months ago
When Novelty Is Not Enough
Abstract. The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intel...
Giuseppe Cuccu, Faustino J. Gomez
165
Voted
FOGA
2011
14 years 6 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...