10988 search results - page 167 / 2198 » Algorithmic Folding Complexity |
104
click to vote
APAL
2004
15 years 3 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
157
Voted
IJCGA
2010
15 years 1 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
169
Voted
DISOPT
2011
14 years 10 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
143
Voted
MP
2011
14 years 10 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
151
Voted
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...