14084 search results - page 308 / 2817 » A Theory for Game Theories |
163
click to vote
CCCG
2008
15 years 8 months ago
2008
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
161
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
The Exact Geometric Computation (EGC) mode of computation has been developed over the last decade in response to the widespread problem of numerical non-robustness in geometric al...
153
click to vote
ESANN
2007
15 years 8 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
130
click to vote
FLAIRS
2004
15 years 8 months ago
2004
We extend the basic axiomatization of interval convex relations by Allen and Hayes with unbounded intervals. Unbounded intervals include since intervals with a finite beginning po...
164
click to vote
FECS
2006
15 years 8 months ago
2006
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...