1454 search results - page 91 / 291 » Stateful traits and their formalization |
109
Voted
IPL
2002
15 years 9 days ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
123
Voted
AGI
2011
14 years 4 months ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
122
Voted
SIAMCOMP
2011
14 years 3 months ago
2011
The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative versi...
168
click to vote
CALCO
2011
Springer
14 years 19 days ago
2011
Springer
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
111
Voted
ROBOCUP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper shows how multiagent systems can be modeled by a combination of UML statecharts and hybrid automata. This allows formal system cation on different levels of ab...