861 search results - page 125 / 173 » Polymorphic Time Systems for Estimating Program Complexity |
AAAI
2008
13 years 10 months ago
2008
This paper summarizes recent work reported at ICAPS on applying artificial intelligence techniques to the control of production printing equipment. Like many other real-world appl...
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
SAS
2005
Springer
14 years 1 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
COMPSAC
2003
IEEE
14 years 29 days ago
2003
IEEE
Short product cycles and rapidly changing requirements are increasingly forcing developers to use agile development strategies like extreme programming and test–driven developme...
HICSS
2002
IEEE
14 years 19 days ago
2002
IEEE
In this paper, we define a continuum of modeling styles, ranging from collections of very simple agents on one end to collections of very complex agents at the other end, and a s...