4940 search results - page 353 / 988 » On the Complexity of Universal Programs |
181
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
178
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
187
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
181
click to vote
ITICSE
2010
ACM
15 years 7 months ago
2010
ACM
Teaching wireless sensor networks (WSNs) at the undergraduate level is both challenging and rewarding. WSNs include low-level programming and debugging, power-aware operations, no...
163
click to vote
SIGPLAN
2008
15 years 6 months ago
2008
Programs encounter increasingly complex and fragile mappings to computing platforms, resulting in performance characteristics that are often mysterious to students, practitioners,...