5109 search results - page 325 / 1022 » On Learning Limiting Programs |
184
click to vote
UML
2005
Springer
16 years 7 days ago
2005
Springer
Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party’s rights and obligations. Contracts written in ...
178
click to vote
ISSTA
2010
ACM
15 years 10 months ago
2010
ACM
Real production code contains lots of knowledge—on the domain, on the architecture, and on the environment. How can we leverage this knowledge in new projects? Using a novel lig...
250
click to vote
JMLR
2012
13 years 9 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
202
click to vote
JMLR
2012
13 years 9 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
197
Voted
IWMM
2010
Springer
15 years 8 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...