334 search results - page 4 / 67 » Dynamic Three-Dimensional Linear Programming |
EACL
2003
ACL Anthology
14 years 11 months ago
2003
ACL Anthology
In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within...
TSMC
2002
14 years 9 months ago
2002
Page-based Linear Genetic Programming (GP) is proposed in which individuals are described in terms of a number of pages. Pages are expressed in terms of a fixed number of instructi...
MP
2006
14 years 9 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
ACL
2010
14 years 7 months ago
2010
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
VLSID
2003
IEEE
15 years 10 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...