Sökning: "heuristisk algoritm"
Visar resultat 1 - 5 av 13 uppsatser innehållade orden heuristisk algoritm.
1. Optimizing the instruction scheduler of high-level synthesis tool
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : With the increasing complexity of the chip architecture design for meeting different application requirements, the corresponding instruction scheduler of high-level synthesis tool needs to solve complex scheduling problems. Dynamically Reconfigurable Resource Array (DRRA) is a novel architecture based on Coarse-Grained Reconfigurable Architecture (CGRA) on SiLago platform, the instruction scheduler of Vesyla-II, the dedicated High-Level Synthesis (HLS) tool targets for DRRA needs to schedule the specific instruction sets designed for Distributed Two-level Control System (D2LC). LÄS MER
2. Heuristic control of a small line-following robot : A comparison of different methods
Magister-uppsats, KTH/Skolan för industriell teknik och management (ITM)Sammanfattning : A line-follower is a robot that follows a line. Line-followers can be used in industry, mostly for material transportation, but are also raced against each other in competitions. While line-followers used in industry prioritize smooth motion and accuracy, competition-style line-followers prioritize speed around the track. LÄS MER
3. Developing A Network Algorithm for Demand Responsive Transit Service in A Rural Area of Sweden
Master-uppsats, KTH/TransportplaneringSammanfattning : Based on the fact that accessibility in rural areas relies heavily on car traffic, call-driven traffic has been used in different regions to improve public transport usage in rural areas, while it has been difficult to maintain due to high maintenance and long waiting time. Over the past decade, a new demand response transit (DRT) service came into light, which combines with new technologies to provide a more attractive and efficient transport service. LÄS MER
4. Tillämpning av en heuristisk algoritm på ett verkligt Period Traveling Salesman Problem och dess effekter på en verksamhet
Kandidat-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : In the Period Travelling Salesman Problem, a salesman must visit a series of stores in a given amount of periods, starting and ending each day in the same home point. In this paper a heuristic algorithm is implemented and tested on a real data set. LÄS MER
5. Automatic Pronoun Resolution for Swedish
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : This report describes a quantitative analysis performed to compare two different methods on the task of pronoun resolution for Swedish. The first method, an implementation of Mitkov’s algorithm, is a heuristic-based method — meaning that the resolution is determined by a number of manually engineered rules regarding both syntactic and semantic information. LÄS MER
