We present Drive, a system for the conceptual layout of 3D path networks. Our sketch-based interface allows users to efficiently author path layouts with minimal instruction. Our system incorporates some new and noteworthy components. We present the break-out lens, a novel widget for interactive graphics, inspired by break-out views used in engineering visualization. We also make three contribu...

The exploitation of dominance relations in constraint optimization problems can lead to dramatic reductions in search space. We propose an automatic method to detect some of the dominance relations manually identified by Chu and Stuckey for optimization problems, and to construct the associated dominance breaking constraints. Experimental results show that the method is able to find several dom...

Overview Diagnosis traditionally viewed as logical reasoning – (de Kleer and Williams 87), (Reiter 87), ... But more naturally viewed as constraint optimization – Minimal set of faulty components, most likely fault, ... Framework that unifies qualitative and quantitative notions of diagnosis using semiring-based CSP – Choose appropriate semiring and construct constraints Diagnosis algorithms ba...

Three-dimensional reconstruction from a single view is an under-constrained process that relies critically upon the availability of prior knowledge about the imaged scene. This knowledge is assumed to be supplied by a user in the form of geometric constraints such as coplanarity, parallelism, perpendicularity, etc, based on his/her interpretation of the scene. In the presence of noise, however,...

Typically, work on preference elicitation and reasoning about preferences has focused on the problem of specifying, modeling, and optimizing with preference over outcomes corresponding to single objects of interest. In a number of applications, however, the “outcomes” of interest are really sets of such atomic outcomes. For instance, when trying to form coalitions or committees, we need to sele...

In this paper we present a constrained optimization approach to aggregate results from multiple slot fillers taking into account the confidence values generated by individual slot fillers. The results obtained from aggregation were used to validate the individual runs. We demonstrated that the proposed aggregation approach led to a significant performance improvement over individual runs for si...

Pattern Search Algorithms for Mixed Variable General Constrained Optimization Problems

This note considers how to modify BnB-ADOPT, a well-known algorithm for optimally solving distributed constraint optimization problems, with a double aim: (i) to avoid sending most of the redundant messages and (ii) to handle cost functions of any arity. Some of the messages exchanged by BnB-ADOPT turned out to be redundant. Removing most of the redundant messages increases substantially commun...

The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we deand reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively...

This paper presents the comparison results on the performance of the Artificial Bee Colony (ABC) algorithm for constrained optimization problems. The ABC algorithm has been firstly proposed for unconstrained optimization problems and showed that it has superior performance on these kind of problems. In this paper, the ABC algorithm has been extended for solving constrained optimization problems...