Sciweavers

1716 search results - page 46 / 344
» Proving Conditional Termination
Sort
View
POPL
2009
ACM
14 years 9 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
VTC
2006
IEEE
108views Communications» more  VTC 2006»
14 years 2 months ago
A New Pricing Function for Power Control Game in Wireless Data Networks
— 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...
Abdorasoul Ghasemi, Karim Faez, Mehdi Dehghan
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 3 months ago
Advanced Channel Estimation for MIMO-OFDM in Realistic Channel Conditions
— 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...
Jos Akhtman, Lajos Hanzo
MP
2011
13 years 3 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
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...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
CADE
2008
Springer
14 years 9 months ago
Automated Induction with Constrained Tree Automata
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...
Adel Bouhoula, Florent Jacquemard