1252 search results - page 146 / 251 » Minimizing Learned Clauses |
143
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
158
click to vote
WCRE
2002
IEEE
15 years 10 months ago
2002
IEEE
Software miniaturization is a form of software refactoring focused on reducing an application to the bare bone. Porting an application on a hand-held device is very likely to requ...
148
click to vote
AAAI
2010
15 years 7 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
132
click to vote
ICML
2008
IEEE
16 years 6 months ago
2008
IEEE
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
153
click to vote
ICML
2004
IEEE
16 years 6 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...