This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional Zinkevich’s projection based online algorithm (Zinkevich 2013) can be difficult to implement due to the potentially high computation complexity of the projection operation. In this paper, we relax the functional con...

Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managing CSPs in a dynamic environment, in order to handle preferences. Unlike the existing CSP models managing one form of preferences, ours supports four types, namely : variable value and constraint preferences, composite...

the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

We prove an exponential lower bound on the size of proofs in the proof system operating with ordered binary decision diagrams introduced by Atserias, Kolaitis and Vardi [2]. In fact, the lower bound applies to semantic derivations operating with sets defined by OBDDs. We do not assume any particular format of proofs or ordering of variables, the hard formulas are in CNF. We utilize (somewhat in...

Because of its useful accuracy and efficiency, density functional theory (DFT) is one of the most widely used electronic structure theories in physics, materials science, and chemistry. Only the exchange-correlation energy is unknown, and needs to be approximated in practice. Exact constraints provide useful information about this functional. The local spin-density approximation (LSDA) was the ...

Conclusions This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, a t a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, ...

this study set out to investigate the distribution of the syntactic properties associatedwith the prodrop parameter by persian-speaking l2 learners of english in an attemptto examine the (un)attainability of native-like knowledge and (in)accessibility of ugin adult sla. to do so, 92 participants were assigned into different levels of l2knowledge based on their performances on the oxford placeme...

The maximum density still life problem (MDSLP) is a hard constraint optimization problem based on Conway’s game of life. It is a prime example of weighted constrained optimization problem that has been recently tackled in the constraint-programming community. Bucket elimination (BE) is a complete technique commonly used to solve this kind of constraint satisfaction problem. When the memory requ...

This paper 1 introduces a new line of research which ensures soundness and completeness in Natural Language text planners on top of an efficient control strategy. The work builds on the HUNTER-GATItERER analysis system (Beale. 96; Beale & Nirenburg, 96). That system employs constraint satisfaction, branch-and-bound and solution synthesis techniques to produce near linear-time processing for kno...

In this paper, we present constraint propagation techniques used in the OPIS scheduling system to update schedule descriptions and detect introduced inconsistencies. Our approach is summarized as follows: • A hierarchical model is used to represent resources and operations to be performed. Schedules are developed and maintained at different levels of precision which are explicitly associated wi...