1813 search results - page 94 / 363 » Instance Pruning Techniques |
142
click to vote
BCS
2008
15 years 6 months ago
2008
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
173
click to vote
IPCO
2008
15 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
106
click to vote
HEURISTICS
2007
15 years 4 months ago
2007
: In this paper we present, to our knowledge, the first application of a metaheuristic technique to the very popular and NP-complete puzzle known as ‘sudoku’. We see that this ...
151
click to vote
IANDC
2007
15 years 4 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
166
click to vote
IEAAIE
2010
Springer
15 years 2 months ago
2010
Springer
An innovative technique based on multi-objective grammar guided genetic programming (MOG3P-MI) is proposed to detect the most relevant activities that a student needs to pass a cou...