908 search results - page 140 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
160
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
Asynchronous circuits operate correctly only under timing assumptions. Hence testing those circuits for delay faults is crucial. This paper describes a three-step method to detect...
131
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. Such algorithms can be at times ineffective ...
164
click to vote
DIS
2009
Springer
15 years 9 months ago
2009
Springer
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
155
click to vote
GECCO
2007
Springer
16 years 3 days ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
145
click to vote
GECCO
2007
Springer
16 years 3 days ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...