Sciweavers

139 search results - page 13 / 28
» How Common Can Be Universality for Cellular Automata
Sort
View
ATVA
2006
Springer
158views Hardware» more  ATVA 2006»
13 years 11 months ago
Model-Based Tool-Chain Infrastructure for Automated Analysis of Embedded Systems
In many safety-critical applications of embedded systems, the system dynamics exhibits hybrid behaviors. To enable automatic analysis of these embedded systems, many analysis tools...
Hang Su, Graham Hemingway, Kai Chen, T. John Koo
COCOA
2007
Springer
14 years 2 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
Eric J. Friedman, Adam Scott Landsberg
AAMAS
2007
Springer
14 years 2 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
SIGCSE
2002
ACM
100views Education» more  SIGCSE 2002»
13 years 7 months ago
Women in CS and biology
Common departmental characteristics and practices in computer science and biology/life science are compared for 46 departments at 23 Virginia colleges and universities. The goal o...
Joanne McGrath Cohoon
VMCAI
2012
Springer
12 years 3 months ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang