-
## Motivation
The implementation of SDDiP in SDDP.jl is bad. If you use it, you will probably run into convergence issues! No need to open an issue, I'm aware of the problem. (If you have challengi…
-
I'm using #698 as a wish list of items to add to the graph theory module of Sage. The purpose of this ticket is to implement the [Bellman-Ford](http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algo…
-
Following this example:
```R
library(data.table)
# define search space
search_space = ps(
cp = p_dbl(lower = 0.001, upper = 0.1),
minsplit = p_int(lower = 1, upper = 10)
)
# initiali…
-
## Background
With Syllabus launching, we need a demo that showcases how the Textbook can be used for an "Introduction to Quantum" course at an undergraduate university. In a user story format, thi…
-
I'd like to contribute by implementing the first algorithm for ranking spanning arborescences (RANK). It's based on [camerini1980ranking]. According to the paper, given a network, RANK computes K most…
-
So if you have this code:
```
module blinky() -> (bit led) {
led[0] = 0;
led[t] = ~led[t-1];
}
```
I think we should interpret the `led[0]` as being the reset value. In other words, if …
-
`UniqueRepresentation` provides a comfortable way to create unique parent structures, and automatically provides a hash and certain comparison methods.
Problems:
- It relies on a metaclass, namely…
-
Issue #1822 reported back in the Summer, 2000 that unit-test were failing when built with
Release-fast and LTO (link time optimization).
###### Progress!
This is a sample of one run, using SN…
-
`SetPartition` uses, as internal representation, a `CloneableArray` with each element being a `Set`. The latter makes the creation and manipulation of set partitions very slow.
Moreover, the curren…
-
Thank you for the great library!
I'm new to Ax and trying it with simple benchmark functions. I found that the EHVI might be less effective than simple Sobol sampling when I test it with the [multi…