699 search results - page 89 / 140 » The method of combinatorial telescoping |
100
Voted
AAAI
1998
15 years 1 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
135
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
103
Voted
EOR
2006
15 years 17 days ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
110
Voted
JIIS
2006
15 years 16 days ago
2006
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...
105
click to vote
JAIR
2007
15 years 14 days ago
2007
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...