Back to Results
First PageMeta Content
Computer programming / Computing / Constraint satisfaction / Sokoban / Common subexpression elimination / Logic programming / Constraint programming / Software engineering / Programming paradigms


Common Subexpressions in Constraint Models of Planning Problems Andrea Rendl, Ian Miguel, Ian P. Gent Peter Gregory School of Computer Science, University of St Andrews, UK
Add to Reading List

Document Date: 2013-08-29 08:25:01

Open Document

File Size: 213,85 KB

Share Result on Facebook

Company

Wilson / /

Currency

USD / /

/

Facility

University of St Andrews / ianm}@cs.st-andrews.ac.uk University of Strathclyde / /

IndustryTerm

appropriate production site / search heuristic / mistake-free solution / industrial applications / search space / collaborative planning systems / search nodes / /

OperatingSystem

Linux / /

Organization

University of St Andrews / University of Strathclyde / Glasgow / Ian P. Gent Peter Gregory School of Computer Science / /

Person

Vidal / V / Ian Miguel / Ian P. Gent Peter / /

Position

constraint model for the settlers planning domain / player / temporal POCL planner / /

ProvinceOrState

M. B. / /

Technology

RAM / Dom / artificial intelligence / Linux / /

URL

http /

SocialTag