Back to Results
First PageMeta Content
NP-complete problems / Logic in computer science / Electronic design automation / Formal methods / Boolean algebra / Boolean satisfiability problem / Algorithm / Computational complexity theory / Solver / Theoretical computer science / Applied mathematics / Mathematics


Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu
Add to Reading List

Document Date: 2008-07-01 13:34:37


Open Document

File Size: 594,23 KB

Share Result on Facebook

City

Milano / Portfolio / Main Mall / /

Company

Brown / Andrew / /

/

Facility

Building Algorithm Portfolios / Computer Science University of British Columbia / /

IndustryTerm

real-world applications / classification algorithm / arbitrary algorithm / branch-and-bound algorithms / tree-search algorithms / heuristic algorithms / local search algorithms / running several algorithms / incomplete algorithms / suboptimal algorithm / portfolio algorithms / stochastic algorithms / search tree size / local search solvers / learning algorithms / /

Organization

AI Access Foundation / University of British Columbia / /

Person

Gomes / Mk / Lin Xu Frank Hutter Holger / Holger H. Hoos Kevin / /

Position

model / Bishop / representative / /

Product

SATzilla / Hierarchical Hardness Models Our / /

ProvinceOrState

British Columbia / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

previous algorithm / good algorithm / tree-search algorithms / portfolio algorithms / suboptimal algorithm / artificial intelligence / randomized / incomplete algorithms / one algorithm / arbitrary algorithm / local search algorithms / classification algorithm / SAT algorithms / 1.2 Algorithm / branch-and-bound algorithms / /

URL

http /

SocialTag