SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4996 LNCS, Issue , 2008, Pages 133-138

Online estimation of SAT solving runtime

(2) Haim, Shai a Walsh, Toby a

a CSIRO (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

#SAT PROBLEMS; (E ,2E) THEORY; COST ESTIMATIONS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; LINEAR MODELING; ON-LINE ESTIMATION; ON-LINE METHODS; RUN TIME; SAT SOLVING; SATISFIABILITY (SAT) SOLVERS; SATISFIABILITY TESTING; SEARCH COSTS; SPRINGER (CO); STRUCTURED PROBLEMS;

COST BENEFIT ANALYSIS; ESTIMATION; FORECASTING; MATHEMATICAL MODELS; SOFTWARE TESTING;

BOOLEAN FUNCTIONS;

EID: 44649152871 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-79719-7_12 Document Type: Conference Paper

Times cited : (10)

References (9)

1
- 0036044679
- Satometer: How much have we searched?
- IEEE, Los Alamitos
- Aloul, F., Sierawski, B., Sakallah, K.: Satometer: How much have we searched? In: Design Automation Conf., pp. 737-742. IEEE, Los Alamitos (2002)
- (2002) Design Automation Conf , pp. 737-742
- Aloul, F.¹ Sierawski, B.² Sakallah, K.³

2
- 30344450270
- An extensible SAT-solver
- Een, N., Sorensson, N.: An extensible SAT-solver. Theory and Applications of Satisfiability Testing, 502-518 (2003)
- (2003) Theory and Applications of Satisfiability Testing , pp. 502-518
- Een, N.¹ Sorensson, N.²

3
- 44649123089
- SAT Solving Cost Estimation using Online Techniques
- Technical Report 0805, UNSW, Australia February
- Haim, S., Walsh, T.: SAT Solving Cost Estimation using Online Techniques, Technical Report 0805, UNSW, Australia (February 2008)
- (2008)
- Haim, S.¹ Walsh, T.²

4
- 0012302244
- A Bayesian approach to tackling hard computational problems
- Horvitz, E., Ruan, Y., Gomes, C., Kautz, H., Selman, B., Chickering, M.: A Bayesian approach to tackling hard computational problems. In: Proc. the 17th Conf. on Uncertainty in Artificial Intelligence (UAI 2001) (2001)
- (2001) Proc. the 17th Conf. on Uncertainty in Artificial Intelligence (UAI
- Horvitz, E.¹ Ruan, Y.² Gomes, C.³ Kautz, H.⁴ Selman, B.⁵ Chickering, M.⁶

5
- 33750734670
- Estimating Search Tree Size
- AAAI, Menlo Park
- Kilby, P., Slaney, J., Thié baux, S., Walsh, T.: Estimating Search Tree Size. In: Proc. of the 21st National Conf. of Artificial Intelligence, AAAI, Menlo Park (2006)
- (2006) Proc. of the 21st National Conf. of Artificial Intelligence
- Kilby, P.¹ Slaney, J.² Thié baux, S.³ Walsh, T.⁴

6
- 0005498651
- Kokotov, D., Shlyakhter, I.: Progress bar for sat solvers (unpublished manuscript) (2000), http://sdg.lcs.mit.edu/satsolvers/progressbar.html
- (2000) Progress bar for sat solvers (unpublished manuscript)
- Kokotov, D.¹ Shlyakhter, I.²

7
- 84957035400
- Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
- Springer, Heidelberg
- Leyton-Brown, K., Nudelman, E., Shoham, Y.: Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. In: Proc. of the 8th Int. Conf. on Principles and Practice of Constraint Programming, pp. 556-572. Springer, Heidelberg (2002)
- (2002) Proc. of the 8th Int. Conf. on Principles and Practice of Constraint Programming , pp. 556-572
- Leyton-Brown, K.¹ Nudelman, E.² Shoham, Y.³

8
- 36348955599
- Learning to Solve QBF
- Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: Proc. of 22nd Conf. on Artificial Intelligence (AAAI 2007) (2007)
- (2007) Proc. of 22nd Conf. on Artificial Intelligence (AAAI
- Samulowitz, H.¹ Memisevic, R.²

9
- 38349063502
- Hierarchical Hardness Models for SAT
- Xu, L., Hoos, H.H., Leyton-Brown, K.: Hierarchical Hardness Models for SAT Principles and Practice of Constraint Programming, 696-711 (2007)
- (2007) Principles and Practice of Constraint Programming , pp. 696-711
- Xu, L.¹ Hoos, H.H.² Leyton-Brown, K.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.