Sciweavers

1995 search results - page 287 / 399
» What's the Problem
Sort
View
LICS
1997
IEEE
15 years 7 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
SI3D
1995
ACM
15 years 7 months ago
The Sort-First Rendering Architecture for High-Performance Graphics
Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Anothe...
Carl Mueller
ICML
1994
IEEE
15 years 7 months ago
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
ICIA
2007
15 years 6 months ago
VizScript: Visualizing Complex Interactions in Multi-Agent Systems
We address the problem of users creating visualizations to debug and understand multi-agent systems. The key challenges are that (1) needs arise dynamically, i.e., it is difficult...
Jing Jin, Rajiv T. Maheswaran, Romeo Sanchez, Pedr...
WSC
2008
15 years 6 months ago
How to build valid and credible simulation models
In this tutorial we present techniques for building valid and credible simulation models. Ideas to be discussed include the importance of a definitive problem formulation, discuss...
Averill M. Law