Sciweavers

14158 search results - page 2673 / 2832
» Generalized switch-setting problems
Sort
View
SIGCSE
2006
ACM
146views Education» more  SIGCSE 2006»
15 years 9 months ago
Introductory game creation: no programming required
Many incoming college freshmen have accumulated a significant number of hours of experience playing computer games. Extending that experience to actual game creation activities ca...
A. T. Chamillard
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 9 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
SIGIR
2006
ACM
15 years 9 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
« Prev « First page 2673 / 2832 Last » Next »