Sciweavers

2446 search results - page 65 / 490
» Choiceless Polynomial Time
Sort
View
NIPS
2003
14 years 11 months ago
Learning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
GD
2008
Springer
14 years 11 months ago
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Evmorfia N. Argyriou, Michael A. Bekos, Michael Ka...
ICGI
2010
Springer
14 years 11 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka