Back to Results
First PageMeta Content
Stochastic control / Operations research / Partially observable Markov decision process / Reinforcement learning / Markov decision process / Heuristic function / Mathematical optimization / Pruning / Branch and bound / Statistics / Dynamic programming / Markov processes


SPIDER Attack on a Network of POMDPs: Towards Quality Bounded Solutions
Add to Reading List

Document Date: 2007-04-18 17:31:17

Open Document

File Size: 295,00 KB

Share Result on Facebook

Company

Goldman / Bernstein / Intel / /

/

Event

Company Expansion / /

Facility

Kyushu University / University of Southern California / /

Holiday

Assumption / /

IndustryTerm

classical heuristic search algorithm / SPIDER algorithm / pre-processing step / example search tree / multiagent systems / multi-agent systems / heuristic search method / agent chain / policy search techniques / approximate solution / policy search / time to solution / approximate algorithm / search tree / heuristic search techniques / computing / heuristic search algorithm / techniques that compute globally optimal solutions / bound search / approximate solutions / search tree node / candidate optimal solution / /

Organization

Kyushu University / Fukuoka / University of Southern California / Los Angeles / Artificial Copyright Intelligence / Association for the Advancement / /

Person

Makoto Yokoo / RAM SPIDER / Ai / /

Position

rt / representative / /

ProgrammingLanguage

T / /

ProvinceOrState

GOA / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Region

Southern California / /

Technology

relevant algorithm / heuristic search algorithm / Network Distributed POMDP Algorithm / DCOP algorithm / artificial intelligence / VAX algorithm / approximate algorithm / classical heuristic search algorithm / GOA algorithm / basic SPIDER algorithm / SPIDER algorithm / JESP algorithm / /

URL

www.aaai.org / /

SocialTag