<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Competitions on Miquel's Portfolio</title><link>https://miquelt9.github.io/portfolio/posts/competitions/</link><description>Recent content in Competitions on Miquel's Portfolio</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Tue, 21 Nov 2023 06:00:23 +0600</lastBuildDate><atom:link href="https://miquelt9.github.io/portfolio/posts/competitions/index.xml" rel="self" type="application/rss+xml"/><item><title>Ecoforecast</title><link>https://miquelt9.github.io/portfolio/posts/competitions/ecoforecast/</link><pubDate>Tue, 21 Nov 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/ecoforecast/</guid><description>&lt;h2 id="the-challenge"&gt;The challenge&lt;/h2&gt;
&lt;p&gt;With increasing digitalisation and the growing on data servers, the significance of sustainable computing is on the rise. That&amp;rsquo;s why the task is to predict which will be the European country that will have the highest surplus of green energy in the following hour. Knowing this information can be critical to make important decisions in order to reduce CO2 emissions.
This
&lt;a href="https://nuwe.io/dev/competitions/schneider-electric-european-2023/ecoforecast-revolutionizing-green-energy-surplus-prediction-in-europe" target="_blank" rel="noopener"&gt;challenge&lt;/a&gt; was the problem of a Nuwe competition.&lt;/p&gt;</description></item><item><title>Junction 2023</title><link>https://miquelt9.github.io/portfolio/posts/competitions/junction2023/</link><pubDate>Sun, 12 Nov 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/junction2023/</guid><description>&lt;p&gt;Since I was in Finland for Erasmus, I decided it was a great opportunity to take part in a Hackathon there, and so I joined
&lt;a href="https://www.junction2023.com/" target="_blank" rel="noopener"&gt;Junction 2023&lt;/a&gt;.&lt;/p&gt;
&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;Because creating habits is really important, Bernat, René and me, re-imagined Huawei Health app to make it attractive and satisfying for young people to do sports daily and weekly via a quests system with which everyone can compete as well as cooperate in order to get the most points across your friends and get better deals in Huawei products.&lt;/p&gt;</description></item><item><title>JBarcelona 2023</title><link>https://miquelt9.github.io/portfolio/posts/competitions/jobbarcelona2023/</link><pubDate>Sun, 23 Apr 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/jobbarcelona2023/</guid><description>&lt;h2 id="the-challenge"&gt;The challenge&lt;/h2&gt;
&lt;p&gt;This
&lt;a href="https://nuwe.io/dev/competitions/job-barcelona-23/jobarcelona-23-data-science" target="_blank" rel="noopener"&gt;challenge&lt;/a&gt; was the problem of a Nuwe competition. The goal of the challenge was to build a classification model which had to predict which costumers decide to end their contracts with the company we get the data from, so the percentage of people who stop being clients decreses by analyzing the reasons.&lt;/p&gt;
&lt;h2 id="the-approach"&gt;The approach&lt;/h2&gt;
&lt;p&gt;Since this was my first time building a model, I decided to start by looking at some guides and understand what had to exactly do the model. I manage to get something and predict some results, and it was really nice when I checked and turn out I had a f1-score of 0.9. Then I also tried some optimitzations which didn&amp;rsquo;t work, but that was enough to pass to the final.&lt;/p&gt;</description></item><item><title>HackUPC 2023</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2023/</link><pubDate>Tue, 07 Feb 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2023/</guid><description>&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;
&lt;a href="https://hackupc.com/" target="_blank" rel="noopener"&gt;HackUPC&lt;/a&gt; is the main yearly hackathon organized in my university. In 2023 was my first time attending on site.&lt;/p&gt;
&lt;p&gt;Me,
&lt;a href="https://github.com/AlexRG03" target="_blank" rel="noopener"&gt;AlexRG03&lt;/a&gt;,
&lt;a href="https://github.com/Martaw-code" target="_blank" rel="noopener"&gt;Martaw-code&lt;/a&gt; and
&lt;a href="https://github.com/Koldp/" target="_blank" rel="noopener"&gt;Koldp&lt;/a&gt; took part at the competition. We were very indecisive in terms of which challenge to go for, but in the end we decided to work in the HP challenge, in which we had to build a prediction model to forecast the supply chain inventory units of HP.
Because we wanted to get even more work we were also thinking about how to solve other challenges and even coding a bot that battled in a survival game between all other hackers.&lt;/p&gt;</description></item><item><title>Chips-Chips</title><link>https://miquelt9.github.io/portfolio/posts/competitions/funcions-numerables/</link><pubDate>Sun, 13 Nov 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/funcions-numerables/</guid><description>&lt;h2 id="the-challenge"&gt;The challenge&lt;/h2&gt;
&lt;p&gt;The goal of this challenge was to minimize the average length of chains that connected pins in a chip, while also trying to minimize the standard deviation of the lengths of the different chains. This was a problem set by Qualcomm for the
&lt;a href="https://datathon.cat/2022/" target="_blank" rel="noopener"&gt;FME Datathon 2022&lt;/a&gt; which had the aim of minimizing the power loss across a chip.&lt;/p&gt;
&lt;h2 id="our-approach"&gt;Our approach&lt;/h2&gt;
&lt;p&gt;Together with
&lt;a href="https://github.com/paulaesquerra" target="_blank" rel="noopener"&gt;Paula&lt;/a&gt;,
&lt;a href="https://github.com/ruthilberry" target="_blank" rel="noopener"&gt;Ruth&lt;/a&gt;,
&lt;a href="https://github.com/AlexRG03" target="_blank" rel="noopener"&gt;Àlex&lt;/a&gt; and I, we decided to approach the problem by modelling it by considering a graph where the nodes are pins and the edges cables. We implemented 2 strategies:&lt;/p&gt;</description></item><item><title>Google Hash Code 2022</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2022/</link><pubDate>Thu, 24 Feb 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2022/</guid><description>&lt;p&gt;
&lt;a href="https://codingcompetitions.withgoogle.com/hashcode" target="_blank" rel="noopener"&gt;Google Hash Code&lt;/a&gt; is a team programming competition that lasts about 4 hours, in which a solution to multiple inputs of a problem must be given, points are given depending on how good it is. Not happy enought with the result we got during our last attempt at this competition we decided to try again.&lt;/p&gt;
&lt;h2 id="the-problem"&gt;The problem&lt;/h2&gt;
&lt;p&gt;In 2022 a list of contributors (with mastered skills) and a list of projects with different skill requirements were given. Contributors could improve their skills by completing projects and can mentor each other to work is roles in which they couldn&amp;rsquo;t succeed on their own. The task was to assign the contributors to project roles that fit them and maximize the score for completed projects.&lt;/p&gt;</description></item><item><title>Royal Hackaway v6</title><link>https://miquelt9.github.io/portfolio/posts/competitions/royalhackawayv6/</link><pubDate>Mon, 07 Feb 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/royalhackawayv6/</guid><description>&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;When
&lt;a href="https://github.com/BernatBC" target="_blank" rel="noopener"&gt;@BernatBC&lt;/a&gt;,
&lt;a href="https://github.com/alexland7219" target="_blank" rel="noopener"&gt;@alexland7219&lt;/a&gt;,
&lt;a href="https://github.com/Loparc" target="_blank" rel="noopener"&gt;@Loparc&lt;/a&gt;, and I discovered that a shark plushies were one of the prizes of an clearly underated challenge, we realized that
the UK&amp;rsquo;s hackathons needed a way to optimally distribute the shark flushies across the country.&lt;/p&gt;
&lt;p&gt;Therefore, we develop a simulator that allows them to place the distribution centers and hackathons (and link them), as well as how many plushie vans you want and its capacity, and it will find a optimal route at the same time it satisfies the demand.&lt;/p&gt;</description></item><item><title>HackUPC 2021</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2021/</link><pubDate>Sun, 16 May 2021 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2021/</guid><description>&lt;!-- &lt;div style="position: relative; padding-bottom: 56.25%; height: 0; overflow: hidden;"&gt;
&lt;iframe allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share; fullscreen" loading="eager" referrerpolicy="strict-origin-when-cross-origin" src="https://www.youtube.com/embed/-AzCSZg9y1A?autoplay=0&amp;amp;controls=1&amp;amp;end=0&amp;amp;loop=0&amp;amp;mute=0&amp;amp;start=0" style="position: absolute; top: 0; left: 0; width: 100%; height: 100%; border:0;" title="YouTube video"&gt;&lt;/iframe&gt;
&lt;/div&gt;
--&gt;
&lt;br /&gt;
&lt;p&gt;
&lt;a href="https://hackupc.com/" target="_blank" rel="noopener"&gt;HackUPC&lt;/a&gt; is the main yearly hackathon organized in my university. In 2021 because of the pandemic we decided to take part from home.&lt;/p&gt;
&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;
&lt;a href="https://github.com/BernatBC" target="_blank" rel="noopener"&gt;@BernatBC&lt;/a&gt;,
&lt;a href="https://github.com/JCasahuga" target="_blank" rel="noopener"&gt;@JCasahuga&lt;/a&gt; and I went to it as 1st year students, it was indeed our first hackathon. We were there for fun and learning new things. That year, the project didn&amp;rsquo;t have to had a theme (even though later we found people tend to do one of the partners challenges). Without much knowledge we ended up creating a 2D game using Unity, given that two of us already had little experience and it was a great time learn how to develop further.&lt;/p&gt;</description></item><item><title>Google Hash Code 2021</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2021/</link><pubDate>Thu, 25 Feb 2021 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2021/</guid><description>&lt;p&gt;
&lt;a href="https://codingcompetitions.withgoogle.com/hashcode" target="_blank" rel="noopener"&gt;Google Hash Code&lt;/a&gt; is a team programming competition that lasts about 4 hours, in which a solution to multiple inputs of a problem must be given, points are given depending on how good it is.&lt;/p&gt;
&lt;h2 id="the-problem"&gt;The problem&lt;/h2&gt;
&lt;p&gt;In 2021 a city road network was given and planned paths for all cars in it, we had to optimize the schedule of traffic lights to minimize the total amount of time spent and help as many cars as possible reach their destination.&lt;/p&gt;</description></item></channel></rss>