1716 search results - page 46 / 344 » Proving Conditional Termination |
221
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
126
click to vote
VTC
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper presents a new pricing function for noncooperative power control game in a single cell CDMA data network. Considering a utility function for each terminal, the purpo...
127
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— An advanced decision-directed channel estimation scheme is proposed, which is suitable for employment in a wide range of multi-antenna multi-carrier systems as well as for comm...
142
Voted
MP
2011
14 years 10 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
138
click to vote
CADE
2008
Springer
16 years 3 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...