908 search results - page 143 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
106
click to vote
ACSC
2005
IEEE
15 years 7 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
111
Voted
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
115
click to vote
COR
2008
15 years 2 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
VLSI
2010
Springer
15 years 8 days ago
2010
Springer
—Multi-Vdd techniques enable application of lower supply voltage levels on cells with timing slacks. New voltage assignment, placement and voltage island partitioning methods are...
112
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In multiobjective particle swarm optimization (MOPSO) methods, selecting the local best and the global best for each particle of the population has a great impact on the convergen...