5316 search results - page 43 / 1064 » Which Search Problems Are Random |
111
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
103
Voted
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
124
Voted
IRREGULAR
1995
Springer
15 years 4 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
85
Voted
IVC
2000
15 years 16 days ago
2000
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
LCN
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...