231 search results - page 41 / 47 » Concurrent Reachability Games |
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary...
CHI
2005
ACM
14 years 9 months ago
2005
ACM
Few systems combine both Embodied Conversational Agents (ECAs) and multimodal input. This research aims at modeling the behavior of adults and children during their multimodal int...
PLDI
2009
ACM
14 years 3 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
FASE
2006
Springer
14 years 7 days ago
2006
Springer
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...