107 search results - page 5 / 22 » Near-optimal algorithms for unique games |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we present a game theoretic approach to solve the static load balancing problem in a distributed system which consists of heterogeneous computers connected by a sing...
ICTAI
2003
IEEE
2003
IEEE
A Diversity-Controlling Adaptive Genetic Algorithm for the Vehicle Routing Problem with Time Windows
14 years 23 days ago
This paper presents an adaptive genetic algorithm (GA) to solve the Vehicle Routing Problem with Time Windows (VRPTW) to near optimal solutions. The algorithm employs a unique dec...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
ICML
1998
IEEE
14 years 8 months ago
1998
IEEE
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...