Back to Results
First PageMeta Content
Computing / Local consistency / Constraint optimization / Constraint satisfaction problem / Constraint satisfaction / Backtracking / Branch and bound / Pruning / Decomposition method / Constraint programming / Software engineering / Computer programming


Weighted Constraint Satisfaction Problems with Min-Max Quantifiers∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong {jlee,wk
Add to Reading List

Document Date: 2013-10-06 08:30:44

Open Document

File Size: 245,20 KB

Share Result on Facebook

City

New York / /

Company

Pearson / Cambridge University Press / Max Resource Allocation Problem Suppose N / /

Country

United States / /

/

Facility

Engineering The Chinese University of Hong Kong Shatin / /

IndustryTerm

devise arc consistency algorithms / basic alpha-beta pruning algorithm / guide search / alpha-beta algorithm / minimax algorithm / search nodes / search starts / alpha-beta search / game-tree search / online solving / search space / alphabeta pruning algorithm / alpha-beta pruning algorithm / branch-and-bound search / /

Organization

Cambridge University / Quantifiers∗ Jimmy H.M. Lee & Terrence W.K. Mak Department of Computer Science / Brown University / Chinese University of Hong Kong Shatin / Research Grants Council of Hong Kong SAR / QWCSP P / /

Person

Ian Gent / K. L. Leung / Min-Max Quantifiers∗ Jimmy / Jimmy H.M. Lee / John Wiley / Justin Yip / Terrence W.K. Mak / /

/

Position

numbers player / Player / /

ProvinceOrState

North Carolina / /

Technology

solving algorithm / alpha / artificial intelligence / alpha-beta algorithm / Specific filtering algorithms / alphabeta pruning algorithm / devise arc consistency algorithms / basic alpha-beta pruning algorithm / minimax algorithm / alpha-beta pruning algorithm / /

SocialTag