Browsing by Keywords "Computational complexity"
Now showing items 120 of 86

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 ... 
Applications of hybrid discrete Fourier transform moment method to the fast analysis of large rectangular dipole arrays printed on a thin grounded dielectric substrate
(Wiley, 2002)Recently a discrete Fourier transformmethod of moments (DFTMoM) scheme was developed for fast analysis of electrically large rectangular planar dipole arrays, which has been shown to be very efficient in terms of number ... 
An approximation algorithm for computing the visibility region of a point on a terrain and visibility testing
(IEEE, 201401)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 ... 
Are stock prices too volatile to be justified by the dividend discount model?
(Elsevier, 2007)This study investigates excess stock price volatility using the variance bound framework of LeRoy and Porter [The presentvalue relation: tests based on implied variance bounds, Econometrica 49 (1981) 555574] and of Shiller ... 
Assembly line balancing using genetic algorithms
(Kluwer Academic Publishers, 2000)Assembly Line Balancing (ALB) is one of the important problems of production/operations management area. As small improvements in the performance of the system can lead to significant monetary consequences, it is of utmost ... 
Asymptotically optimal contextual bandit algorithm using hierarchical structures
(Institute of Electrical and Electronics Engineers, 2018)We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the ... 
Automated detection and enhancement of microcalcifications in mammograms using nonlinear subband decomposition
(IEEE, 1997)In this paper, computeraided detection and enhancement of microcalcifications in mammogram images are considered. The mammogram image is first decomposed into subimages using a `subband' decomposition filter bank which ... 
Clutter detection algorithms for airborne pulseDoppler radar
(IEEE, 2010)Clutter detection is an important stage of target detection. Clutter may not always appear around zero Doppler frequency when realistic terrain models and moving platforms are considered. Two algorithms developed for clutter ... 
A comparative study of computational procedures for the resource constrained project scheduling problem
(Elsevier, 1994)Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ... 
A comparison of historical relational query languages
(ASME, 199407)We introduce a historical relational data model in which N1NF relations are used and 1level of nesting is allowed. Attributes can either be atomic or temporal atom. An atomic attribute represents a time invariant attribute. ... 
Comparison of local and global computation and its implications for the role of optical interconnections in future nanoelectronic systems
(Elsevier, 1993)Various methods of simulating diffusion phenomena with parallel hardware are discussed. In particular methods are compared requiring local and global communication among the processors in terms of total computation time. ... 
Comparisons of FMM implementations employing different formulations and iterative solvers
(IEEE, 200306)The implementation of multilevel fast multipole algorithm (MLFMA) requires the consideration of several parameters. The preferred combination of the parameters given is not trivially obvious and requires a careful ... 
Competitive location and pricing on a line with metric transportation costs
(Elsevier, 20200401)Consider a threelevel noncapacitated location/pricing problem: a firm first decides which facilities to open, out of a finite set of candidate sites, and sets service prices with the aim of revenue maximization; then a ... 
Complexity of the discrete timecost tradeoff problem for project networks
(Institute for Operations Research and the Management Sciences (INFORMS), 1997)This note addresses the discrete version of the wellknown timecost tradeoff problem for project networks, which has been studied previously in the standard project management literature as well as in the related literature ... 
A complexityreduced ML parametric signal reconstruction method
(2011)The problem of component estimation from a multicomponent signal in additive white Gaussian noise is considered. A parametric ML approach, where all components are represented as a multiplication of a polynomial amplitude ... 
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 ... 
Computational aspects of the maximum diversity problem
(Elsevier, 1996)We address two variations of the maximum diversity problem which arises when m elements are to be selected from an nelement population based on interelement distances. We study problem complexity and propose randomized ... 
Computationally efficient wavelet affine invariant functions for 2D object recognition
(IEEE, 2003)In this paper, an affine invariant function is presented for object recognition from wavelet coefficients of the object boundary. In previous works, undecimated wavelet transform was used for affine invariant functions. ... 
Computationally efficient wavelet affine invariant functions for shape recognition
(IEEE, 2004)An affine invariant function for object recognition is constructed from wavelet coefficients of the object boundary. In previous works, undecimated dyadic wavelet transform was used to construct affine invariant functions. ... 
Correlation tracking based on wavelet domain information
(SPIE, 2004)Tracking moving objects in video can be carried out by correlating a template containing object pixels with pixels of the current frame. This approach may produce erroneous results under noise. We determine a set of ...