Back to Results
First PageMeta Content
Mathematical sciences / Applied mathematics / Normal-form game / Mathematical optimization / Linear programming / Best response / Partially observable Markov decision process / Game theory / Operations research / Statistics


Journal of Artificial Intelligence Research–443 Submitted 08/14; publishedComputing Convex Coverage Sets for Faster Multi-objective Coordination
Add to Reading List

Document Date: 2015-03-31 01:49:26

Open Document

File Size: 872,85 KB

Share Result on Facebook

Company

Wilson / Amax / /

/

Facility

Informatics Institute University of Amsterdam Amsterdam / /

IndustryTerm

stochastic solutions / abstract algorithm / sufficient solutions / tree search / road network / coupled systems / sufficient solution / tree search linear support / bounded approximation algorithm / /

Organization

University of Amsterdam Amsterdam / AI Access Foundation / /

Person

Gonzales / Ai / Shimon Whiteson Frans / /

Position

Bishop / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

OLS algorithm / CMOVE algorithm / resulting algorithm / two main algorithms / artificial intelligence / VELS algorithm / two algorithms / bounded approximation algorithm / /

SocialTag