223 search results - page 10 / 45 » Approximate local search in combinatorial optimization |
90
Voted
AAAI
2004
15 years 1 months ago
2004
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
EVOW
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
GECCO
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
100
Voted
CAD
2005
Springer
14 years 11 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...