A New method for markov processes with repetitive structures

Download
076076.pdf
1998
Tüfekçi, Tolga
Show full item record
166
views
0
downloads
Markov processes, Algorithms
https://hdl.handle.net/11511/2005
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A Command Generation Approach for Desktop Fused Filament Fabrication 3D Printers
Yaman, Ulaş; Dölen, Melik (2016-10-27)
This study develops a novel command generation paradigm for desktop fused filament fabrication 3D printers. In the conventional approach, designed artifact in CAD software is saved as an STL file, which is still a de-facto file standard in the field, and then imported into the CAM software of the corresponding 3D printer. After adjusting the printing parameters (feed rate, layer thickness, infill percentage, etc.), the G-code file is generated within the CAM software and it is transferred to the printer for...
An interactive preference based multiobjective evolutionary algorithm for the clustering problem
Demirtaş, Kerem; Özdemirel, Nur Evin; Karasakal, Esra; Department of Industrial Engineering (2011)
We propose an interactive preference-based evolutionary algorithm for the clustering problem. The problem is highly combinatorial and referred to as NP-Hard in the literature. The goal of the problem is putting similar items in the same cluster and dissimilar items into different clusters according to a certain similarity measure, while maintaining some internal objectives such as compactness, connectivity or spatial separation. However, using one of these objectives is often not sufficient to detect differ...
An interactive evolutionary algorithm for the multiobjective relocation problem with partial coverage
Orbay, Berk; Karasakal, Esra; Department of Operational Research (2011)
In this study, a bi-objective capacitated facility location problem is presented which includes partial coverage concept and relocation of facility nodes. In partial coverage, a predefined distance between a demand node and a facility node is assumed to be fully covered. After the predefined distance, the service level commences to decay linearly. The problem is designed to consider the existence of already functioning facility nodes. It is allowed to close these existing facilities and open new facilities ...
A Multithreaded Recursive and Nonrecursive Parallel Sparse Direct Solver
Bölükbaşı, Ercan Selçuk (2016-01-01)
Sparse linear system of equations often arises after discretization of the partial differential equations (PDEs) such as computational fluid dynamics, material science, and structural engineering. There are, however, sparse linear systems that are not governed by PDEs, some examples of such applications are circuit simulations, power network analysis, and social network analysis. For solution of sparse linear systems one can choose using either a direct or an iterative method. Direct solvers are based on so...
A Bayesian Approach to Learning Scoring Systems
Ertekin Bolelli, Şeyda (2015-12-01)
We present a Bayesian method for building scoring systems, which are linear models with coefficients that have very few significant digits. Usually the construction of scoring systems involve manual efforthumans invent the full scoring system without using data, or they choose how logistic regression coefficients should be scaled and rounded to produce a scoring system. These kinds of heuristics lead to suboptimal solutions. Our approach is different in that humans need only specify the prior over what the ...
Citation Formats
T. Tüfekçi, “A New method for markov processes with repetitive structures,” Ph.D. - Doctoral Program, Middle East Technical University, 1998.
METU IIS - Integrated Information Service open@metu.edu.tr