Skip to main content

Unanswered Questions

242 questions with no upvoted or accepted answers
1 vote
0 answers
84 views

CUDA BFS algorithm

I've recently been working on a project that measured difference on different scale/type of mazes between CPU and GPU. I chose probably the most straightforward one, which is BFS. I won't really ...
0 votes
0 answers
65 views

Computing \$k\$ most reliable paths in undirected probabilistic graphs in Java

Intro (See MostProbablePath.java.) This time, I elaborate on Computing most probable (reliable) path in a probabilistic graph (take II): instead of computing the most reliable path I now return \$k\$ ...
1 vote
0 answers
69 views

PathFinding.java: Drawing a random perfect maze via randomized DFS

Intro Still working on PathFinding.java. This time I concentrate on three private methods of GridModel that are responsible for generating random perfect mazes. A maze is perfect if for each two cells ...
2 votes
0 answers
69 views

Lock free Leaky Bucket Rate Limiter

I want to validate my solution for a lock-free leaky bucket rate limiter. Given a queuing capacity and rate limit per second, it should queue requests till capacity is reached and it should allow only ...
0 votes
0 answers
25 views

Mathematica implementation of Lempel method for constructing Costas arrays

I ported C++ implementation of Lempel method for constructing Costas arrays to Mathematica. How to fix my code? Thanks in advance. ...
1 vote
0 answers
74 views

Fixed BIDDFS (bidirectional iterative deepening depth first search) in Java

Intro I have this GitHub repository for doing pathfinding in directed unweighted graphs. This post is about BIDDFS proposed by Richard Korf in his paper. Code ...
2 votes
0 answers
60 views

Use Mathematica to calculate Treewidth

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. I wrote Mathematica code to calculate Treewidth based on the Python ...
2 votes
0 answers
36 views

Mathematica implementation of Welch method for constructing Costas arrays

I ported C++ implementation of Welch method for constructing Costas arrays to Mathematica. Any feedback would be appreciated. ...
1 vote
0 answers
42 views

LibID: a Java library containing some iterative deepening algorithms for pathfinding on directed unweighted graphs

Intro I have this GitHub repository containing some iterative deepening pathfinding algorithms. Code ...
4 votes
0 answers
90 views

SHA1 Algorithm Implementation in Zig

I have implemented the SHA1 algorithm in Zig, as a learning exercise, to teach myself both Zig and the actual algorithm behind SHA1. Now the second part I think I understood well enough. The ...
2 votes
0 answers
193 views

How to make this arbitrary precision π calculator using Machin-like formula run faster?

Two days ago (or yesterday depending on your timezone) was π-day. So I thought it was a good day to calculate π. I used Machin-like formula to calculate π, in homage of William Shanks, who calculated ...
1 vote
0 answers
78 views

Brzozowski Algebraic Method for converting finite automaton from NFA to DFA

The Brzozowski Algebraic Method is a technique used in automata theory, specifically for constructing the minimal deterministic finite automaton (DFA) from a given nondeterministic finite automaton (...
4 votes
0 answers
68 views

Connect Four AI vs. AI match in Javascript

This time, I have a Javascript program that runs a Connect Four match between two Alpha-beta pruning based AI bots. (See this page.) ai-battle.html: ...
5 votes
0 answers
118 views

Dial's heap in Java for integer priority queues

(The entire project is here.) Intro I have this priority queue data structure for non-negative integer priority keys. I recall that it is called Dial's heap. Code Implementation ...
2 votes
0 answers
75 views

A machine learning model for predicting bit strings in Java

I have this GitHub repository (BitPredictor.java). Basically, I tried to harness a machine learning model for predicting bit strings. I have implemented it to the best of my understanding and have ...

15 30 50 per page
1
2 3 4 5
17