We use the Margin Infused Relaxed Algorithm of Crammer et al. to add a large number of new features to two machine translation systems: the Hiero hierarchical phrasebased translation system and our syntax-based translation system. On a large-scale ChineseEnglish translation task, we obtain statistically significant improvements of +1.5 B and +1.1 B, respectively. We analyze the impact of ...

In this paper we introduce a hybrid relaxed-extragradient method for finding a common element of the set of common fixed points of N nonexpansive mappings and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping. The hybrid relaxed-extragradient method is based on two well-known methods: hybrid and extragradient. We derive a strong convergence ...

A performance prediction method is presented, which accurately predicts the expected program execution time on massively parallel systems. We consider distributed-memory architectures with SMD nodes and a fast communication network. The method is based on a relaxed task graph model, a queuing model, and a memory hierarchy model. The relaxed task graph is a compact representation of communicatin...

A performance prediction method is presented, which accurately predicts the execution time of programs on massively parallel computers. We consider a computer architecture with shared-memory multiprocessor nodes and a communication network connecting these nodes. The method combines a relaxed task graph model, a queueing model and a memory hierarchy model. The relaxed task graph is a compact re...

This work investigates the computational procedures used to obtain global solution to the Economic Linear Optimal Control (ELOC) problem. The proposed method employs the Generalized Benders Decomposition (GBD) algorithm. Compared to the previous branch and bound approach, a naive application GBD to the ELOC problem will improve computational performance, due to less frequent calls to computatio...

Bundle methods have been used frequently to solve nonsmooth optimization problems. In these methods, subgradient directions from past iterations are accumulated in a bundle, and a trial direction is obtained by performing quadratic programming based on the information contained in the bundle. A line search is then performed along the trial direction, generating a serious step if the function va...

We introduce a new framework for Property Checking (PC) of sequential circuits. It is based on a method called Logic Relaxation (LoR). Given a safety property, the LoR method relaxes the transition system at hand, which leads to expanding the set of reachable states. For j-th time frame, the LoR method computes a superset Aj of the set of bad states reachable in j transitions only by the relaxe...