6355 search results - page 181 / 1271 » From Logic to Games |
172
click to vote
SIROCCO
2008
15 years 8 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
215
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we address the problem of creating believable agents (virtual characters) in video games. We consider only one meaning of believability, "giving the feeling of...
300
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
170
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are ob...
210
click to vote
LFCS
2009
Springer
16 years 1 months ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...