-
Hi all,
I have a general question about SnapVX.
Currently I have a social network with location information of each individual, which mean apart from the social network, I also have neighborhood bas…
-
The equations are still wrong.
On real problems we get increasing cost.
Also the optimization is currently very dependent on the regularization values.
changing them slightly can produce very diffe…
dswah updated
8 years ago
-
The following exception was thrown when trying to solve a graph of size 50 with 3 colors using Backtracking with Forward Checking.
> g
> graph size:50
> s
> Choose a solver (Min-conflicts, Simple-bac…
-
Lookup refs are resolved prior to insertion, by running a `SELECT` query.
That's fine for 'unit transacts', but for bulk insertions it's cripplingly slow: 10-50msec per query multiplied by the number…
-
This patch will add a function that gives all sublattices of a lattice.
CC: @tscrim
Component: **combinatorics**
Keywords: **lattice poset, days78**
Author: **Jori Mäntysalo**
Branch: **[`1bb…
-
There is a backtracking algorithm that explores all possible hamiltonian paths by using DFS on a decision tree (this tree is just the call graph of the algorithm, it is not instantiated):
![image](ht…
-
I've got a leaking megacarbon instances. The load is low - 50-100k metrics per minute. Config is simple - i have a pipeline 2 relays with aggregated-consistent-hashing -> 1 aggregator with consistent …
-
## Expected behavior and actual behavior
OrientDB version used: 2.1.10
I am uploading full dbpedia dataset into orientDB. I have created a schema in which i have some properties defined on my custom …
-
Many things the non-backtracking operator is used for can be done with iterative solvers instead of direct solvers. I am thinking of detecting graph structures from the eigenvalues and eigenvectors or…
-
3>E:\src\re2\re2\dfa.cc(104): warning C4200: nonstandard extension used: zero-sized array in struct/union
3> E:\src\re2\re2\dfa.cc(104): note: Cannot generate copy-ctor or copy-assignment operator wh…