1050 search results - page 68 / 210 » Towards programming for the non-technical |
MST
2008
13 years 8 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
SIGPLAN
2008
13 years 8 months ago
2008
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...
ISHPC
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Dynamic program optimization is the only recourse for optimizing compilers when machine and program parameters necessary for applying an optimization technique are unknow...
CSFW
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract. Interactive programs allow users to engage in input and output throughout execution. The ubiquity of such programs motivates the development of models for reasoning about...