Sciweavers

739 search results - page 73 / 148
» New Games Related to Old and New Sequences
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
13 years 9 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
ATAL
2010
Springer
13 years 10 months ago
Frequency adjusted multi-agent Q-learning
Multi-agent learning is a crucial method to control or find solutions for systems, in which more than one entity needs to be adaptive. In today's interconnected world, such s...
Michael Kaisers, Karl Tuyls
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 17 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
AIED
2009
Springer
14 years 3 months ago
I learn from you, you learn from me: How to make iList learn from students
We developed a new model for iList, our system that helps students learn linked list. The model is automatically extracted from past student data, and allows iList to track student...
Davide Fossati, Barbara Di Eugenio, Stellan Ohlsso...
TEI
2010
ACM
128views Hardware» more  TEI 2010»
14 years 3 months ago
Texturing the "material turn" in interaction design
Advances in the creation of computational materials are transforming our thinking about relations between the physical and digital. In this paper we characterize this transformati...
Erica Robles, Mikael Wiberg