Sciweavers

4816 search results - page 316 / 964
» Performance analysis of the AntNet algorithm
Sort
View
COR
2006
138views more  COR 2006»
15 years 6 months ago
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
GECCO
2000
Springer
15 years 10 months ago
Sampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
Shigeyoshi Tsutsui
SPIN
2000
Springer
15 years 10 months ago
Using Runtime Analysis to Guide Model Checking of Java Programs
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
Klaus Havelund
205
Voted
SPIN
2000
Springer
15 years 10 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
15 years 8 months ago
A fast counterexample minimization approach with refutation analysis and incremental SAT
- It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
ShengYu Shen, Ying Qin, Sikun Li