5331 search results - page 195 / 1067 » Algebraic Methods for Optimization Problems |
125
Voted
CAIP
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The estimation of human age from face images is an interesting problem in computer vision. We proposed a general distance metric learning scheme for regression problems, ...
126
Voted
EUROCAST
2009
Springer
15 years 9 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
106
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents an investigation of genetic programming fitness landscapes. We propose a new indicator of problem hardness for tree-based genetic programming, called negative ...
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited represe...
108
Voted
IJON
2008
15 years 2 months ago
2008
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...