850 search results - page 38 / 170 » heuristics 2006 |
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
MP
1998
13 years 10 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
MANSCI
2010
13 years 9 months ago
2010
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
NPL
2006
13 years 11 months ago
2006
Effective backpropagation training of multi-layer perceptrons depends on the incorporation of an appropriate error or objective function. Classification-based (CB) error functions ...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability