A

artificial-intelligence

Aston University DG1AID lab repository with AI and data science notes, Python notebooks, NumPy, Pandas, search algorithms and machine learning practice.

A project-agnostic Spec-Driven Development (SDD) workspace optimized for AI-assisted programming. Features automated project onboarding, structured user story drafting, and strict TDD workflows to minimize AI hallucinations.

aGrUM is a C++ library designed for easily building applications using graphical models such as Bayesian networks, influence diagrams, decision trees, GAI networks or Markov decision processes.

YowYob Search is a smart local discovery and search platform designed to help users find businesses, services, offers, places and relevant information through a unified and intuitive experience. The platform combines search, geolocation, user contributions, intelligent recommendations and AI-assisted interactions to improve information accessibility and decision-making. Built with a modular and scalable architecture, YowYob Search is designed to integrate with the Yowyob Kernel Core ecosystem and collaborate with other academic and industrial projects through a common service-oriented platform.

Academic chatbot project developed during undergraduate studies using Python and basic Natural Language Processing concepts for conversational interaction.

Academic NLP project focused on multilingual text summarization using Transformer-based deep learning models and natural language processing techniques.

Consultoría B2B en Inteligencia Artificial y Agentes Autónomos. 🌐 https://empleadointeligente.com

AI Tools and Technology Resources by Lucifer Tech. Premium AI subscriptions, guides, and reviews for ChatGPT, Claude, Midjourney and more.

Simulation d’un jeu Tic Tac Toe sur une grille 10x10 avec une condition de victoire de 5 pions alignés.

Le projet fournit un moteur de jeu simple permettant de :

faire jouer deux agents (IA vs IA / LLM vs LLM) tester des stratégies connecter une interface CLI ou Web ultérieurement

Le moteur gère la logique complète :

validation des coups alternance des joueurs détection de victoire (horizontal, vertical, diagonales) détection de match nul stratégie de mouvement simple (fallback)

Projet pédagogique en algorithmie et intelligence artificielle.

The efficient alternative to Neural Networks. Implements SLRM (Segmented Linear Regression Model) for neural compression and non-linear data modeling, achieving high precision with a fraction of the parameters of a traditional ANN.

[2025] European news intelligence platform with dual-layer AI sentiment analysis. Tracks media narrative shifts across 12 sources using VADER baseline + Gemini nuance, vector embeddings for semantic search, and interactive relationship mapping with real-time trend visualization.

[2025] Autonomous Claude Code plugin with pattern learning and skill auto-selection. Features 27 specialized agents across 4 collaborative groups, quality control automation, and intelligent task execution without human approval at each step.

An MCP server for personal second-brain purposes

The aim of N-Queens Problem is to place N queens on an N x N chessboard, in a way so that no queen is in conflict with the others.

This Python code employs the Depth-First Search (DFS) algorithm to find a path from "Arad" to "Bucharest" in the Romania map. It uses a priority queue, backtracking, and a graph representation. The DFS path is printed at the end. Skills demonstrated include graph traversal, priority queue usage, and DFS algorithm implementation.

The code uses backtracking to solve the Constraint Satisfaction Problem (CSP) of map coloring. It checks if assigning colors to regions follows the constraint that no adjacent regions have the same color. The skills involved include algorithm design for backtracking, recursion, and solving CSP problems. The implementation uses Python.