Back to Results
First PageMeta Content
Search algorithms / NP-complete problems / Heuristics / Approximation algorithm / Computational complexity theory / Heuristic function / Minimax / Algorithm / Closest string / Mathematics / Theoretical computer science / Applied mathematics


Document Date: 2013-09-14 08:17:58

Open Document

File Size: 191,99 KB

Share Result on Facebook

City

Pukelsheim / /

Company

Voting Systems / /

Event

FDA Phase / /

Facility

Washington University / Institute of Electrical / /

IndustryTerm

minisum solution / nonmanipulable algorithms / fixedsize-minisum solution / polynomial-time approximation algorithms / approximation algorithm / local search heuristics / nonmanipulable polynomial-time approximation algorithm / endogenous minimax solution / local search / genetic algorithms / polynomial-time algorithm / recommender systems / above algorithm / minimax solution / minimax solutions / polynomial time α-approximation algorithm / approximate solutions / decision making applications / approximation algorithms / fixed-size-minisum solution / /

MarketIndex

set 20 / /

Movie

A. D. / /

Organization

Institute of Electrical / Institute of Electrical and Electronics Engineers / Game Theory Society / A. / Washington University / St. Louis / American Mathematical Society / Finnish Political Science Association / Department of Computer Science and Engineering / /

PoliticalEvent

council election / /

Position

representative / /

Product

Minimax Solution / /

ProvinceOrState

Missouri / Washington / /

PublishedMedium

Journal of the ACM / /

Technology

above algorithm / polynomial-time approximation algorithms / nonmanipulable polynomial-time approximation algorithm / following algorithm / 3 Approximation Algorithms / artificial intelligence / polynomial time α-approximation algorithm / approximation algorithm / polynomial-time algorithm / approximation algorithms / 3-approximation algorithm / two algorithms / /

SocialTag