1144 search results - page 65 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
PAMI
2006
14 years 9 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
105
click to vote
AAAI
2000
14 years 11 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
ISCAS
2005
IEEE
15 years 3 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...
TKDE
2008
14 years 9 months ago
2008
We present a genetic algorithm for tackling a file assignment problem for a large-scale video-on-demand system. The file assignment problem is to find the optimal replication and a...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...