Sciweavers

1477 search results - page 24 / 296
» Complexity of (iterated) dominance
Sort
View
FOCM
2010
108views more  FOCM 2010»
15 years 4 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward
TCS
2008
15 years 6 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
DAM
2007
77views more  DAM 2007»
15 years 6 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
GLOBECOM
2006
IEEE
16 years 4 days ago
Two Novel Iterative Joint Frequency-Offset and Channel Estimation Methods for OFDMA Uplink
—We address joint estimation of frequency offsets and channel responses in OFDMA uplink. A cyclically equal-spaced, equal-energy interleaved pilot preamble is proposed by which t...
Xiaoyu Fu, Hlaing Minn, Cyrus D. Cantrell
LORI
2009
Springer
16 years 19 days ago
Strategy Elimination in Games with Interaction Structures
Abstract. We study games in the presence of an interaction structure, which allows players to communicate their preferences, assuming that each player initially only knows his own ...
Andreas Witzel, Krzysztof R. Apt, Jonathan A. Zves...