Results 1  10
of
624,254
Concise Integer Linear Programming Formulations for Dependency Parsing
, 2009
"... We formulate the problem of nonprojective dependency parsing as a polynomialsized integer linear program. Our formulation is able to handle nonlocal output features in an efficient manner; not only is it compatible with prior knowledge encoded as hard constraints, it can also learn soft constraint ..."
Abstract

Cited by 57 (11 self)
 Add to MetaCart
We formulate the problem of nonprojective dependency parsing as a polynomialsized integer linear program. Our formulation is able to handle nonlocal output features in an efficient manner; not only is it compatible with prior knowledge encoded as hard constraints, it can also learn soft
An Integer Linear Programming Formulation of the Cophylogeny Reconstruction Problem
, 2008
"... The cophylogeny reconstruction problem is that of finding minimal cost explanations of differences between evolutionary histories of ecologically linked groups of biological organisms. A general form of this problem is known to be NPcomplete [2] and the problem is conjectured to remain intractable ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
intractable under a variety of assumptions. Therefore, heuristics and optimized search algorithms are needed for this problem. This report shows how the problem can be formulated as an integer linear programming (ILP) problem. Using this formulation, ILP solvers may be used to solve the problem or
Integer linear programming formulation of the generalized vehicle routing problem
 In Proceedings of the 5th EURO/INFORMS Joint International Meeting
, 2003
"... The Generalized Vehicle Routing Problem (GVRP) is an extension of the Vehicle Routing Problem (VRP) defined on a graph in which the nodes (customers, vertices) are grouped into a given number of mutually exclusive and exhaustive clusters (nodesets). In this paper, an integer linear programming formu ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The Generalized Vehicle Routing Problem (GVRP) is an extension of the Vehicle Routing Problem (VRP) defined on a graph in which the nodes (customers, vertices) are grouped into a given number of mutually exclusive and exhaustive clusters (nodesets). In this paper, an integer linear programming
An Integer Linear Programming Formulation for Tiling Large Rectangles using 4 6 and 5 7 Tiles
, 2010
"... An Integer linear programming formulation for tiling large rectangles using 4 x 6 and 5 x 7 tiles Grant Dietert Follow this and additional works at: ..."
Abstract
 Add to MetaCart
An Integer linear programming formulation for tiling large rectangles using 4 x 6 and 5 x 7 tiles Grant Dietert Follow this and additional works at:
Generic Integer Linear Programming Formulation for 3D IC Partitioning
 Journal of Information Science and Engineering
, 2010
"... The success of 3D IC requires novel EDA techniques. Although many EDA techniques exist, this paper focuses on 3D IC partitioning, especially at the architectural level to maximize its benefits. First, logical formulations for 3D IC partitioning problems were derived and then the formulations were tr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
transformed into integer linear programs (ILPs). The ILP formulation can minimize the usage of vertical interconnects subject to the footprint and power consumption constraints. The flexibility of ILP formulation can be demonstrated by extending the generic ILP formulation to support designs with multiple
AN INTEGER LINEAR PROGRAMMING FORMULATION AND GENETIC ALGORITHM FOR THE MAXIMUM SET SPLITTING PROBLEM
"... Abstract. We consider the maximum set splitting problem (MSSP). For the first time an integer linear programming (ILP) formulation is presented and validity of this formulation is given. We propose a genetic algorithm (GA) that uses the binary encoding and the standard genetic operators adapted to t ..."
Abstract
 Add to MetaCart
Abstract. We consider the maximum set splitting problem (MSSP). For the first time an integer linear programming (ILP) formulation is presented and validity of this formulation is given. We propose a genetic algorithm (GA) that uses the binary encoding and the standard genetic operators adapted
Optimizing Fault Coverage for Error Resilient Applications: An Integer Linear Programming Formulation
"... Abstract—In recent years, a number of high level applications have been reported to be tolerant to errors resulting from a sizeable fraction of all single stuckat faults in hardware. Production testing of devices targeted towards such applications calls for a test vector set that is tailored to max ..."
Abstract
 Add to MetaCart
to maximize the coverage of faults that lead to functionally malignant errors while minimizing the coverage of faults that produce functionally benign errors. Given a partitioning of the fault set as benign and malignant, and a complete test vector set that covers all faults, we formulate an integer linear
Opinion summarization with integer linear programming formulation for sentence extraction and ordering
 In Proceedings of COLING
, 2010
"... In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences and directly acquire the optimum sequence from multiple review documents by extracting and ordering the sentences. We ach ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
achieve this with a novel Integer Linear Programming (ILP) formulation. Our proposed formulation is a powerful mixture of the Maximum Coverage Problem and the Traveling Salesman Problem, and is widely applicable to text generation and summarization tasks. We score each candidate sequence according to its
Article An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem
, 2015
"... algorithms ..."
Mixedinteger linear programming formulation for High Level Synthesis
"... In the field of high level synthesis [2], finding the less costly architecture for processing jobs by a deadline is a major issue. This article addresses this problem in two different ways. The aim is to minimize the cost of the resources needed to process a set of n jobs by a deadline. Each job j h ..."
Abstract
 Add to MetaCart
In the field of high level synthesis [2], finding the less costly architecture for processing jobs by a deadline is a major issue. This article addresses this problem in two different ways. The aim is to minimize the cost of the resources needed to process a set of n jobs by a deadline. Each job j has a release date rj and a deadline dj. The jobs are also subject to precedence constraints, given under the form of a precedence graph G = (V, E). Each node in V represents a job, and each directed arc in E from the node i to the node j specifies that job i must be completed before job j can start. The available resources are electronic operators belonging to K different types, and that can be modeled by multipurpose machines, as any operator may not be able to process any job. More precisely, job j can be processed by an operator of type k if and only if qj,k = 1, where q is a nbyK boolean matrix. Furthermore, pj,k is the processing time of job j when assigned to an operator of type k, provided that qj,k = 1. It must be noticed that p and q are given matrices, they are not decision variables. For all k in [1, K], ck is the cost of an operator of type k. The objective function can be written as
Results 1  10
of
624,254