Browsing by Keywords "Problem solving"
Now showing items 1-20 of 120
-
Accuracy and efficiency considerations in the solution of extremely large electromagnetics problems
(IEEE, 2011)This study considers fast and accurate solutions of extremely large electromagnetics problems. Surface formulations of large-scale objects lead to dense matrix equations involving millions of unknowns. Thanks to recent ... -
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
(Academic Press, 2007-01)Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS decomposition problem is modeled as a graph ... -
Algorithms for layout of disconnected graphs
(Elsevier, 2000)We present efficient algorithms for the layout of disconnected objects in a graph (isolated nodes and components) for a specified aspect ratio. These linear and near-linear algorithms are based on alternate-bisection and ... -
Analysis of an arbitrary profile reflector antenna system having resistive type surface–E-polarization case
(IEEE, 2006-06)The regularized solution is performed for arbitrary shape conic section profile geometry. In this case the reflector surface is taken as made up of resistive type material. The problem is formulated depending on the circular ... -
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
(Taylor & Francis, 1999)Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves ... -
Analysis of the 2D nonconcentric large reflector antenna-in-radome system: H-polarization case
(IEEE, 2004)2D nonconcentric reflector antenna-in-radome system is analyzed for H-polarization case. Rigorous formulation is performed depending on the MoR, Green's function and CSP methods. Larger geometries are solved in reasonable ... -
An animation system for fracturing of rigid objects
(Springer, Berlin, Heidelberg, 2005)This paper describes a system for the animation of fracturing brittle objects. The system combines rigid body simulation methods with a constraint-based model to animate fracturing of arbitrary polyhedral shaped objects ... -
Approaches for inequity-averse sorting
(Elsevier, 2016)In this paper we consider multi-criteria sorting problems where the decision maker (DM) has equity concerns. In such problems each alternative represents an allocation of an outcome (e.g. income, service level, health ... -
An approximation algorithm for computing the visibility region of a point on a terrain and visibility testing
(IEEE, 2014-01)Given a terrain and a query point p on or above it, we want to count the number of triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and ... -
Automatic multimedia cross-modal correlation discovery
(ACM, 2004-08)Given an image (or video clip, or audio song), how do we automatically assign keywords to it? The general problem is to find correlations across the media in a collection of multimedia objects like video clips, with colors, ... -
Batch scheduling to minimize the weighted number of tardy jobs
(Pergamon Press, 2007)In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ... -
A beam search-based algorithm and evaluation of scheduling approaches for fexible manufacturing systems
(Taylor & Francis, 1998)This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and ... -
Binary integer formulation for mixed-model assembly line balancing problem
(Pergamon Press, 1998-04-01)The assembly line balancing problem has been a focus of interest to the academicians of production/operations management for the last 40 years. Although there are numerous studies published on the various aspects of the ... -
Capture resilient ElGamal signature protocols
(Springer, 2006-11)One of the fundamental problems of public key cryptography is protecting the private key. Private keys are too long to be remembered by the user, and storing them in the device which performs the private key operation is ... -
Chat mining for gender prediction
(Springer, 2006-10)The aim of this paper is to investigate the feasibility of predicting the gender of a text document's author using linguistic evidence. For this purpose, term- and style-based classification techniques are evaluated over ... -
Coaching engineering freshmen at Bilkent University
(Middle East Technical University, Faculty of Engineering, 2005)In September 2003, the Faculty of Engineering at Bilkent University created an office to help first year students adapt to university life and start their academic studies effectively. For each of the three Departments of ... -
Combined-field solution of composite geometries involving open and closed conducting surfaces
(IEEE, 2005-04)Combined-field integral equation (CFIE) is modified and generalized to formulate the electromagnetic problems of composite geometries involving both open and closed conducting surfaces. These problems are customarily ... -
Comparison of surface-modeling techniques
(IEEE, 1997-07)Solution techniques based on surface integral equations are widely used in computational electromagnetics. The accurate surface models increase the accuracy solutions by using exact and flat-triangulation models for a ... -
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
(Elsevier, 2005)This paper presents an improved version of a componentwise bounding algorithm for the state probability vector of nearly completely decomposable Markov chains, and on an application it provides the first numerical results ... -
Composite regions of feasibility for certain classes of distance constrained network location problems
(INFORMS, 1996)Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The ...
