7280 search results - page 1158 / 1456 » Optimization Techniques |
184
Voted
ICML
2002
IEEE
16 years 8 months ago
2002
IEEE
In many reinforcement learning applications, the set of possible actions can be partitioned by the programmer into subsets of similar actions. This paper presents a technique for ...
199
Voted
ICML
1997
IEEE
16 years 8 months ago
1997
IEEE
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
166
Voted
ICSE
2009
IEEE-ACM
16 years 8 months ago
2009
IEEE-ACM
A variety of compilers, static analyses, and testing frameworks rely heavily on path frequency information. Uses for such information range from optimizing transformations to bug ...
205
click to vote
ICSE
2008
IEEE-ACM
16 years 8 months ago
2008
IEEE-ACM
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
198
Voted
SIGSOFT
2009
ACM
16 years 8 months ago
2009
ACM
A program is reentrant if distinct executions of that program on distinct inputs cannot affect each other. Reentrant programs have the desirable property that they can be deployed...