Sciweavers

1698 search results - page 68 / 340
» Growing Complex Games
Sort
View
IJCAI
2007
14 years 11 months ago
Deictic Option Schemas
Deictic representation is a representational paradigm, based on selective attention and pointers, that allows an agent to learn and reason about rich complex environments. In this...
Balaraman Ravindran, Andrew G. Barto, Vimal Mathew
CHI
2010
ACM
15 years 4 months ago
Understanding usability practices in complex domains
Although usability methods are widely used for evaluating conventional graphical user interfaces and websites, there is a growing concern that current approaches are inadequate fo...
Parmit K. Chilana, Jacob O. Wobbrock, Andrew J. Ko
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 10 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
ALT
2003
Springer
15 years 6 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
HPCC
2007
Springer
15 years 4 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...