498 search results - page 82 / 100 » A Theory of Complexity for Continuous Time Systems |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
HT
2009
ACM
14 years 1 months ago
2009
ACM
While weblogs have been conceptualised as personal thinking spaces since their early days, those uses have not been studied in detail. The purpose of this paper is to explore how ...
PERVASIVE
2005
Springer
14 years 26 days ago
2005
Springer
The retail store environment is a challenging application area for Pervasive Computing technologies. It has demanding base conditions due to the number and complexity of the interd...
ROBOCUP
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
ERLANG
2004
ACM
14 years 24 days ago
2004
ACM
Structured Programming techniques are applied to a personal accounting software application implemented in erlang as a demonstration of the utility of processes as design construc...