Fast Algorithms for the Density Finding Problem

By Lee D.   Lin Tien-Ching   Lu Hsueh-I  

Algorithmica, Vol. 53, Iss. 3, 2009-03 ,pp. : 298-313

Springer Publishing Company

Access to resources Recommend Favorite

Parallel algorithms for finding polynomial Roots on OTIS-torus

By Lucas Keny   Jana Prasanta  

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 139-153

Springer Publishing Company

Access to resources Recommend Favorite

Local Search-based Hybrid Algorithms for Finding Golomb Rulers

By Cotta Carlos   Dotú Iván   Fernández Antonio   Hentenryck Pascal  

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 263-291

Springer Publishing Company

Access to resources Recommend Favorite

Learning automata-based algorithms for finding cover sets in wireless sensor networks

By Mohamadi Hosein   Ismail Abdul   Salleh Shaharuddin   Nodhei Ali  

The Journal of Supercomputing, Vol. 66, Iss. 3, 2013-12 ,pp. : 1533-1552

Springer Publishing Company

Access to resources Recommend Favorite

Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding

By Pan V.Y.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 701-733

Academic Press

Access to resources Recommend Favorite