Sciweavers

31 search results - page 5 / 7
» A Comparison of Algorithms for Multi-player Games
Sort
View
CAV
2007
Springer
121views Hardware» more  CAV 2007»
14 years 5 days ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
LATIN
2004
Springer
13 years 11 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
FLAIRS
2009
13 years 3 months ago
Beating the Defense: Using Plan Recognition to Inform Learning Agents
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
Matthew Molineaux, David W. Aha, Gita Sukthankar
AGI
2011
12 years 9 months ago
Comparing Humans and AI Agents
Comparing humans and machines is one important source of information about both machine and human strengths and limitations. Most of these comparisons and competitions are performe...
Javier Insa-Cabrera, David L. Dowe, Sergio Espa&nt...
BMCBI
2002
131views more  BMCBI 2002»
13 years 5 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida