Searching for "Searching Is Not Jumping." – sorted by Relevance.
-
A Random Jump Strategy for Combinatorial Search
- A Random Jump Strategy for Combinatorial Search Hantao Zhang ∗ Computer Science Department
- Cited by 5 (0 self) – Add To MetaCart
-
Hit-or-Jump: An Algorithm for Embedded Testing with Applications to in Services
- exhaustive search and random walks; both are special cases of Hit-or-Jump. The algorithm has been implemented
- Cited by 9 (6 self) – Add To MetaCart
-
Sparse Data Structures for Weighted Bipartite Matching
- ; the search jumps from row to row rather than scanning entire rows. Bertsekas’s auction algorithm performs
- Add To MetaCart
-
From JoJo to Frog: Extending a bi-directional Search Strategy to a more flexible three
- points for the search for the refined rules. 3. Frog: Three-directional Search by Jumps The strong
- Cited by 1 (0 self) – Add To MetaCart
-
Spiking Boltzmann machines
- the search to jump over energy barriers. The search can be improved by using simulated annealing (Kirkpatrick
- Cited by 4 (1 self) – Add To MetaCart
-
Course Production - Quick and Effective
- , one can access the lecture arbitrarily often, scroll, search, and jump on a particular section without
- Cited by 2 (1 self) – Add To MetaCart
-
Encoding Feedforward Networks for Topology Optimization By Simulated Evolution
- it is only useful for fine tuning of the topology. In contrast, big search jumps are done by crossover. 3
- Cited by 1 (0 self) – Add To MetaCart
-
Using Software Visualization technology to help Genetic Algorithm Designers
- of the search, jumping back ten generations, stepping back one generation, stepping forward one generation
- Add To MetaCart
-
Combinatorial Group Testing Methods for the BIST Diagnosis Problem
- Batched Digging Binary Search Jumping Multi-Stage Batching 0 0 200 400 600 800 1000 Number of Faults (d
- Cited by 5 (0 self) – Add To MetaCart
-
An Iterative Re-start Variable Neighbourhood Search For The Examination Timetabling Problem
- the search to jump to a poor solution which may be difficult to escape from. Therefore, in our approach, we
- Cited by 1 (1 self) – Add To MetaCart

