Code implementation of "Learning Efficient Online 3D Bin Packing on Packing Configuration Trees". We propose to enhance the practical applicability of online 3D Bin Packing Problem (BPP) via learning on a hierarchical packing configuration tree which makes the deep reinforcement learning (DRL) model easy to deal with practical constraints and well-performing even with continuous solution space.
Evolutionary Algorithm using Python, 莫烦Python 中文AI教学
- evolutionary-algorithm
- genetic-algorithm
- neuroevolution
- microbial-genetic-algorithm
JMLR: OmniSafe is an infrastructural framework for accelerating SafeRL research.
Automatic Exploit Generation (AEG) and remote flag capture for exploitable CTF problems
- angr
- aeg
- shellcode
- buffer-overflow
Solved algorithms and data structures problems in many languages
Source Code for the Book Classic Computer Science Problems in Python
A plugin for Flake8 finding likely bugs and design problems in your program. Contains warnings that don't belong in pyflakes and pycodestyle.
ToRA is a series of Tool-integrated Reasoning LLM Agents designed to solve challenging mathematical reasoning problems by interacting with tools [ICLR'24].
170+ solutions to Hackerrank.com practice problems using Python 3, С++ and Oracle SQL
- hackerrank
- hackerrank-solutions
- hackerrank-python
- hackerrank-sql
This repo contains the projects: 'Virtual Normal', 'DiverseDepth', and '3D Scene Shape'. They aim to solve the monocular depth estimation, 3D scene reconstruction from single image problems.
- 3d-scene-shape
- depth-prediction
Auto-detecting the n+1 queries problem in Python
Using Intel's PIN tool to solve CTF problems
Solve automatic numerical differentiation problems in one or more variables.
Build innovative Skills with McDonald’s MCP, solve real-world problems, and compete for exclusive 1024 Programmers’ Day prizes.
In this project, the Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. I implemented general search algorithms such as depth-first, breadth-first, uniform cost, and A* search algorithms which are used to solve navigation problems in the Pacman world.
Code for the experiment proposed in Section 4.2 of the paper "The Bouncer Problem: Challenges to Remote Explainability".
Implementing GraphQL with joins to avoid the N+1 problem