Sciweavers

3780 search results - page 97 / 756
» Algorithms for Game Metrics
Sort
View
AI
2007
Springer
15 years 6 months ago
Competition and Coordination in Stochastic Games
Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
Andriy Burkov, Abdeslam Boularias, Brahim Chaib-dr...
118
Voted
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 1 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 28 days ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
111
Voted
DAC
2006
ACM
16 years 1 months ago
Games are up for DVFS
Graphics-intensive computer games are no longer restricted to highperformance desktops, but are also available on a variety of portable devices ranging from notebooks to PDAs and ...
Yan Gu, Samarjit Chakraborty, Wei Tsang Ooi
103
Voted
MFCS
2009
Springer
15 years 7 months ago
Stochastic Games with Finitary Objectives
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
Krishnendu Chatterjee, Thomas A. Henzinger, Floria...