Back to Results
First PageMeta Content
Ethology / Artificial intelligence / Operations research / Organizational behavior / Satisficing / Search algorithms / Anytime algorithm / Mathematical optimization / Rationality / Science / Cognitive science / Heuristics


Satisficing and Bounded Optimality
Add to Reading List

Document Date: 2006-01-11 05:34:49


Open Document

File Size: 379,27 KB

Share Result on Facebook

City

Portland / Seattle / Cambridge / Minneapolis / Chambery / Boston / /

Company

MIT Press / Russell / /

Country

France / /

/

Facility

Shlomo Zilberstein* Computer Science Department University of Massachusetts It / University of Massachusetts / University of California at Berkeley / /

IndustryTerm

search process / heuristic search / beena constant search / Contract algorithms / interruptible algorithms / construction algorithm / computational device / algorithmsor systems / step solution / adequate solution / possible contract algorithm / search space / Admissible heuristic search / real-time systems / anytimealgorithmsin intelligent systems / given computational device / be solved efficiently using contract algorithms / /

Movie

Do the Right Thing / /

Organization

Computer Science Division / University of Massachusetts / University of California / Shlomo Zilberstein* Computer Science Department University of Massachusetts It / National Science Foundation / MIT / ComputerScience Department / Thirteenth National Conferenceon Artificial Intelligence / Thirteenth International Joint Conferenceon Artificial Intelligence / Eighth National Conferenceon Artificial Intelligence / /

Person

Shlomo Zilberstein / Herbert Simon / /

/

Position

Author / designer / stochastic model of quality improvement / Dean / /

ProvinceOrState

Minnesota / Oregon / California / Massachusetts / Washington / /

Technology

efficiently using contract algorithms / artificial intelligence / Contract algorithms / possible contract algorithm / construction algorithm / /

URL

www.aaai.org / http /

SocialTag