Sciweavers

489 search results - page 17 / 98
» Formulations and Reformulations in Integer Programming
Sort
View
COLING
2010
13 years 2 months ago
Fast, Greedy Model Minimization for Unsupervised Tagging
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
Sujith Ravi, Ashish Vaswani, Kevin Knight, David C...
COMPLIFE
2005
Springer
14 years 1 months ago
Fast and Accurate Structural RNA Alignment by Progressive Lagrangian Optimization
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
Markus Bauer, Gunnar W. Klau, Knut Reinert
MP
2011
13 years 2 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi
OSN
2007
185views more  OSN 2007»
13 years 7 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
COCOA
2008
Springer
13 years 9 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati