5331 search results - page 401 / 1067 » Algebraic Methods for Optimization Problems |
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
The N-Normalization is an efficient method for normalizing a given similarity computed among multimedia objects. It can be considered for clustering and kernel enhancement. Howev...
141
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We address the volumetric reconstruction problem that takes as input a series of orthographic multi-energy x-ray images, producing as output a reconstructed model space consisting...
177
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
190
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Solutions calculated by Evolutionary Algorithms have come to surpass exact methods for solving various problems. The Rubik’s Cube multiobjective optimization problem is one such ...
176
click to vote
CEC
2003
IEEE
16 years 3 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...