273 uppsatser · sida 15 av 19
En komparativ studie av fyra metoder för relevance feedback
… thesis compares four relevance feedback methods. The Rocchio and Ide dec-hi algorithms for the vector space model and the binary independence model and Okapi BM25 within the probabilistic framework. This is done in a custom-made Information Retrieval system utilizing a …
Kunskap i sociokulturellt eller existentialistiskt perspektiv? En kritisk betraktelse
… (conceptual or practical) situation; a moment (b) which represents an algorithm, a procedure, or a theory; and a moment (c) which represents the result of the act, and is the direct application of knowledge as a finalized entity. Knowledge inbuilt in (a) and (c) is characterized …
… be a too big focus on imitative reasoning, i.e. recalling solutions or follow algorithms, and a lack of creative mathematical reasoning, i.e. when a student construct his/her own solution and motivates its plausibility with mathematically well-founded arguments. The purpose of …
… angular velocities and that the possibility to use an adaptive control algorithm in a real future helicopter is good.
… frequency it makes the task less complex. It is not necessary to use the FFT algorithm. The DFT can be calculated using correlation. Both phase and amplitude can be calculated very precisely with few samples and not so many computer operations.
… be interfaced to a rapid prototyping system which should allow easy changes to algorithms at different levels in the system. The system designated for this project comes from National Instruments and constitutes LabVIEW Real-time and FPGA module as the software tools. The …
… design indices in order to find a set of optimal design parameters. Genetic algorithm (GA) was used for optimization due to the nonlinearity of the multi-objective function. The optimal design parameters were obtained by minimizing the payload index while maximizing the volume …
vägval och utformning i gaturummet
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
Flexibla bostäder för "varannan vecka-familjen"
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
Beräkningsmodeller för medelflöden/medelhastigheter samt utformning av påfartsreglering i Göteborg
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
… Learning decision trees were used for prediction and we evaluate how well the algorithm succeeds with the predictions of the routes the trains will travel. Approximately 90 % of the predictions were correct and we therefore judge the service to be suitable for less critical …
… The goal of this thesis is to study, classifyand search for con?icts. An algorithm has been developed that ?nds some kind ofcon?icts in polynomial time with respect to the size of the graph.
