983 search results - page 26 / 197 » Negative-Weight Cycle Algorithms |
121
click to vote
COR
2004
15 years 2 months ago
2004
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
119
click to vote
AAAI
2004
15 years 4 months ago
2004
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even...
108
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
131
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
139
click to vote
DAC
1994
ACM
15 years 7 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...