1723 search results - page 33 / 345 » Cycling in linear programming problems |
117
click to vote
SAT
2005
Springer
15 years 8 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
118
click to vote
SIAMSC
2010
15 years 25 days ago
2010
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
120
click to vote
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
130
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
116
click to vote
PAMI
2007
15 years 1 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...