526 search results - page 62 / 106 » Efficient Algorithms for Online Decision Problems |
152
Voted
ASE
2005
15 years 3 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
133
click to vote
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
145
click to vote
AAAI
2006
15 years 5 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
123
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
121
click to vote
NIPS
2008
15 years 5 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...