1716 search results - page 244 / 344 » Proving Conditional Termination |
170
click to vote
MCMASTER
1993
15 years 8 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
154
Voted
DC
2010
15 years 3 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
143
click to vote
MCS
2008
Springer
15 years 3 months ago
2008
Springer
In the stability study of nonlinear systems, not to found feasible solution for the LMI problem associated with a quadratic Lyapunov function shows that it doesn't exist posi...
137
click to vote
JSAC
2006
15 years 3 months ago
2006
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
150
click to vote
MP
2010
15 years 2 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...