1814 search results - page 105 / 363 » Improved Results on Geometric Hitting Set Problems |
182
Voted
HEURISTICS
2006
15 years 6 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
163
click to vote
HM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
205
click to vote
ALT
2011
Springer
14 years 6 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
156
click to vote
VLSI
2005
Springer
15 years 11 months ago
2005
Springer
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
187
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...