987 search results - page 75 / 198 » Asynchronous parallel search by the parallel genetic algorit... |
AE
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
CPHYSICS
2006
13 years 9 months ago
2006
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
RSA
1998
13 years 8 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
PDP
2006
IEEE
14 years 2 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...