1204 search results - page 74 / 241 » Termination of Polynomial Programs |
108
Voted
HUC
2000
Springer
15 years 4 months ago
2000
Springer
Although the age of information appliances is getting close, current remote control devices are too awkward, and we cannot control sophisticated equipments without using graphical ...
94
Voted
CG
2006
Springer
15 years 4 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
125
Voted
CADE
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
106
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
106
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...