10890 search results - page 19 / 2178 » Automatic Complexity Analysis |
CORR
2010
Springer
13 years 7 months 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 ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents work-in-progress towards a C++ source-to-source translator that automatically seeks parallelisable code fragments and replaces them with code for a graphics...
IUI
2009
ACM
14 years 6 days ago
2009
ACM
Getting synthetic faces to display natural facial expressions is essential to enhance the interaction between human users and virtual characters. Yet traditional facial control te...
JAIR
1998
13 years 7 months ago
1998
As planning is applied to larger and richer domains the e ort involved in constructing domain descriptions increases and becomes a signi cant burden on the human application desig...
MIDDLEWARE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Developing efficient distributed applications while managing complexity can be challenging. Managing network latency is a key challenge for distributed applications. We ...