Sciweavers

908 search results - page 140 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
ICCAD
1997
IEEE
144views Hardware» more  ICCAD 1997»
15 years 6 months ago
Partial scan delay fault testing of asynchronous circuits
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...
Michael Kishinevsky, Alex Kondratyev, Luciano Lava...
89
Voted
DAC
2005
ACM
16 years 2 months ago
Multi-threaded reachability
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 ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
DIS
2009
Springer
15 years 5 months ago
Discovering Influential Nodes for SIS Models in Social Networks
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...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
15 years 8 months ago
Variable discrimination of crossover versus mutation using parameterized modular structure
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...
Rob Mills, Richard A. Watson
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 8 months ago
Finding critical backbone structures with genetic algorithms
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...
Adam Prügel-Bennett