7342 search results - page 1235 / 1469 » Optimal Language Learning |
248
click to vote
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
136
click to vote
SIGSOFT
2002
ACM
16 years 4 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
225
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
235
click to vote
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
132
Voted
POPL
2010
ACM
16 years 25 days ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...