Browsing by Keywords "Constraint theory"
Now showing items 120 of 25

Analysis of concurrency control protocols for realtime database systems
(Elsevier, 1998)This paper provides an approximate analytic solution method for evaluating the performance of concurrency control protocols developed for realtime database systems (RTDBSs). Transactions processed in a RTDBS are associated ... 
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 constraintbased model to animate fracturing of arbitrary polyhedral shaped objects ... 
A compound graph layout algorithm for biological pathways
(Springer, Berlin, Heidelberg, 20040910)We present a new compound graph layout algorithm based on traditional forcedirected layout scheme with extensions for nesting and other applicationspecific constraints. The algorithm has been successfully implemented ... 
A datalevel parallel linearquadratic penalty algorithm for multicommodity network flows
(Association for Computing Machinery, 1994)We describe the development of a datalevel, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linearquadratic penalty (LQP) algorithm we transform the multicommodity ... 
A derivation of Lovász' theta via augmented lagrange duality
(E D P Sciences, 2003)A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemar´echal and Oustry [9], leads to simple alternative ... 
Design of translucent optical networks: Partitioning and restoration
(Kluwer, 2004)We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning ... 
A distancelimited continuous locationallocation problem for spatial planning of decentralized systems
(Elsevier, 2017)We introduce a new continuous locationallocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water ... 
Dynamic financial planning: certainty equivalents, stochastic constraints and functional conjugate duality
(Taylor & Francis, 2005)This paper studies portfolios under risk and stochastic constraints. Certainty equivalents combine risk aversion and exponential utility to form the objective. Budget and stochastic constraints on the account balance are ... 
A graph based approach for naming faces in news photos
(I E E E Computer Society, 2006)We propose a method to associate names and faces for querying people in large news photo collections. On the assumption that a person's face is likely to appear when his/her name is mentioned in the caption, first all the ... 
Guessing with lies
(IEEE, 20020607)A practical algorithm was obtained for directly generating an optimal guessing sequence for guessing under lies. An optimal guessing strategy was defined as one which minimizes the number of average number of guesses in ... 
Informationbased approach to punctuation
(AAAI, 199707)This thesis analyzes, in an informationbased framework, the semantic and discourse aspects of punctuation, drawing computational implications for Natural Language Processing (NLP) systems. The Discourse Representation ... 
Marginal allocation algorithm for nonseparable functions
(Taylor & Francis, 1999)Marginal allocation algorithm is implemented to discrete allocation problems with nonseparable objective functions subject to a single linear constraint. A Lagrangian analysis shows that the algorithm generates a sequence ... 
Multirelational kanonymity
(IEEE, 200704)kAnonymity protects privacy by ensuring that data cannot be linked to a single individual. In a kanonymous dataset, any identifying information occurs in at least k tuples. Much research has been done to modify a single ... 
On algebraic properties of general proper decentralized systems
(Elsevier, 1993)The new concepts of the decentralized output feedback variable polynomial, the decentralized output feedback cycle index of general proper systems, and the geometric multiplicities of decentralized fixed modes are introduced. ... 
Perception of 3D Surfaces from 2D Contours
(1993)Inference of 3D shape from 2D contours in a single image is an important problem in machine vision. We survey classes of techniques proposed in the past and provide a critical analysis. We propose that two kinds of ... 
Processing realtime transactions in a replicated database system
(Springer/Kluwer Academic Publishers, 1994)A database system supporting a realtime application has to provide realtime information to the executing transactions. Each realtime transaction is associated with a timing constraint, typically in the form of a deadline. ... 
Regenerator placement and traffic engineering with restoration in GMPLS networks
(Springer, 2003)In this paper, we study regenerator placement and traffic engineering of restorable paths in generalized multiprotocol label switching (GMPLS) networks. Regenerators are necessary in optical networks in order to cope with ... 
Simulation optimization: a comprehensive review on theory and applications
(Taylor & Francis, 2004)For several decades, simulation has been used as a descriptive tool by the operations research community in the modeling and analysis of a wide variety of complex real systems. With recent developments in simulation ... 
Solving school bus routing problems through integer programming
(Palgrave Macmillan Ltd., 2007)In this paper, an exact solution approach is described for solving a reallife school bus routing problem (SBRP) for transporting the students of an elementary school throughout central Ankara, Turkey. The problem is ... 
Theoretical investigation on exact blind channel and input sequence estimation
(IEEE, Piscataway, NJ, United States, 1999)Recent work on fractionally spaced blind equalizers have shown that it is possible to exactly identify the channel and its input sequence from the noisefree channel outputs. However, the obtained results are based on a ...