Sciweavers

3625 search results - page 38 / 725
» On choosing
Sort
View
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
16 years 4 days ago
Parallel repetition: simplifications and the no-signaling case
: Consider a game where a referee chooses (x,y) according to a publicly known distribution, sends x to Alice, and y to Bob. Without communicating with each other, Alice responds wi...
Thomas Holenstein
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
15 years 9 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
CSMR
2008
IEEE
15 years 6 months ago
Modularity-Oriented Refactoring
Refactoring, in spite of widely acknowledged as one of the best practices of object-oriented design and programming, still lacks quantitative grounds and efficient tools for tasks...
Sergio Bryton, Fernando Brito e Abreu
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
15 years 5 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
IAT
2005
IEEE
15 years 5 months ago
Creating Wholly Autonomous Agents in On-line Worlds
Recent years have seen an explosion in new types of on­line   worlds   accessible   both   to   human   users   and, increasingly, automated electronic systems...
Steven Willmott