Efficient string matching on packed texts
D. Breslauer, Leszek Gasieniec (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
D. Breslauer, Leszek Gasieniec (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
te Riele, Herman, Williams, Hugh (2003)
Experimental Mathematics
Similarity:
Maziar Salahi (2010)
Kybernetika
Similarity:
It is well known that a large neighborhood interior point algorithm for linear optimization performs much better in implementation than its small neighborhood counterparts. One of the key elements of interior point algorithms is how to update the barrier parameter. The main goal of this paper is to introduce an “adaptive” long step interior-point algorithm in a large neighborhood of central path using the classical logarithmic barrier function having iteration complexity analogous...