519 search results - page 38 / 104 » A New Approach to Strongly Polynomial Linear Programming |
134
click to vote
INFORMS
1998
15 years 1 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
108
click to vote
ICPR
2002
IEEE
16 years 2 months ago
2002
IEEE
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
DAC
2009
ACM
16 years 2 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
134
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
154
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...