Sciweavers

423 search results - page 27 / 85
» Specifying Strategies for Exercises
Sort
View
AAAI
2010
14 years 10 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
ICPP
2006
IEEE
15 years 4 months ago
Achieving Bounded Delay on Message Delivery in Publish/Subscribe Systems
Publish/subscribe (pub/sub) systems are very suitable for the dissemination of dynamic information over the Internet. As dynamic information is usually characterized by a short li...
Jinling Wang, Jiannong Cao, Jing Li, Jie Wu
WOA
2001
14 years 11 months ago
How to Support Adaptive Mobile Applications
The Mobile Agent (MA) paradigm seems to be a promising solution for the design and development of distributed value-added services. However, mobility has added complexity to the d...
Antonio Corradi, Rebecca Montanari, Gianluca Tonti...
ASE
2002
160views more  ASE 2002»
14 years 9 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
JELIA
2004
Springer
15 years 3 months ago
Games for Cognitive Agents
Strategic games model the interaction among simultaneous decisions of agents. The starting point of strategic games is a set of players (agents) having strategies (decisions) and p...
Mehdi Dastani, Leendert W. N. van der Torre