8413 search results - page 22 / 1683 » Ordering Problem Subgoals |
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a fourth order dual method for the minimization of the non-smooth semi-norm
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...