Sciweavers

1683 search results - page 240 / 337
» Game Theory Basics
Sort
View
148
Voted
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 4 months ago
On Graph Crossing Number and Edge Planarization
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
Julia Chuzhoy, Yury Makarychev, Anastasios Sidirop...
ENTCS
2008
72views more  ENTCS 2008»
15 years 4 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
CONNECTION
2006
91views more  CONNECTION 2006»
15 years 4 months ago
From unknown sensors and actuators to actions grounded in sensorimotor perceptions
This article describes a developmental system based on information theory implemented on a real robot that learns a model of its own sensory and actuator apparatus. There is no in...
Lars Olsson, Chrystopher L. Nehaniv, Daniel Polani
IJON
2006
99views more  IJON 2006»
15 years 4 months ago
Learning vector quantization: The dynamics of winner-takes-all algorithms
Winner-Takes-All (WTA) prescriptions for Learning Vector Quantization (LVQ) are studied in the framework of a model situation: Two competing prototype vectors are updated accordin...
Michael Biehl, Anarta Ghosh, Barbara Hammer
JNS
2008
44views more  JNS 2008»
15 years 4 months ago
The Scaling Attractor and Ultimate Dynamics for Smoluchowski's Coagulation Equations
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulat...
Govind Menon, Robert L. Pego