Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Mathematical optimization / Graph theory / Graph coloring / NP-complete / Connectivity / 2-satisfiability / NP / Theoretical computer science / Computational complexity theory / Mathematics


W h e r e t h e Really H a r d P r o b l e m s A r e Peter Cheeseman Bob Kanefsky W i l l i a m M . Taylor
Add to Reading List

Document Date: 2009-10-23 06:18:38


Open Document

File Size: 211,23 KB

Share Result on Facebook

City

London / /

Company

O.R.S.A. / Philips / /

/

Facility

Research Institute / /

IndustryTerm

energy barriers / reasonable algorithm / probablistic search procedure / search algorithm / physical systems / search procedure / search algorithms / search methods / bidirectional search / minimum cost solution / /

Organization

Taylor RIACS* Sterling Software Sterling Software Artificial Intelligence Research Branch NASA Ames Research Center / Institute for Advanced Computer Science In / /

Person

Nat / Addison Wesley / Peter Cheeseman Bob Kanefsky / /

Position

Traveling Salesman / /

ProgrammingLanguage

TSP / /

Technology

reasonable algorithm / artificial intelligence / search algorithm / search algorithms / /

SocialTag