-
### Motivation
[Hill climbing](https://en.wikipedia.org/wiki/Hill_climbing) is a local search algorithm commonly used for optimization problems. The sampler based on the hill-climbing algorithm aims …
-
I've been working with the mode decomposition function in Meep to extract the expansion coefficients, alpha_n (using the notation from meep's website), at different values of k for a structure which i…
-
### Bug Description
The `HashGrid` does not correctly traverse cells through the periodic boundary condition. It does for particles close to the right edge - but not for particles in the vicinity of …
-
### Describe the idea
In the real world, routing quality is highly dependent on the street intersections found along the way, and a big factor in that is the kind of `highways` that enter/exit that…
-
@PolarBean Recording the results of testing, we can discuss more in person.
I've found discrepancies in "region_area" results from PyNutil and Nutil for nonlinear datasets, which I think originate …
-
Ability to enable/disable the display of the "bubble" of factions with the color matching the color of the factions to see all the intersection points of neighboring factions.
-
`chr13 84309984 Minda_37 N . PASS SVLEN=788;SVTYPE=DEL;SUPP_VEC=PB_ID_14112_2,PB_d_83,ONT_ID_58187_2,ONT_d_43,ILL_MantaDEL:205694:0:1:0:0:0,PB_severus_DEL1823,ONT_severus_DEL2014,PB_Sniffles2.DEL.1AC…
-
Instead of setting row and column sizes (which doesn't translate 100% to hex grids), treat all cells individually. Cells would be stored simply as a point representing their center, and borders would …
-
Right now code calculates the distances between all the points many times in a nested loops which gets really inefficient as a number of points grow.
I would suggest two things:
1. To simplify c…
-
# Task
Specify and run neighbor integration tests for your deployed service/component, ensuring compatibility and smooth operation alongside neighboring services.
The goal is to make sure that your …