Sciweavers

1242 search results - page 98 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
ATAL
2010
Springer
14 years 11 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
AUTONOMICS
2009
ACM
15 years 4 months ago
Sensor Selection for IT Infrastructure Monitoring
Supervisory control is the main means to assure a high level performance and availability of large IT infrastructures. Applied control theory is used in physical and virtualization...
Gergely János Paljak, Imre Kocsis, Zolt&aac...
SEAAI
1998
Springer
15 years 2 months ago
On theoretical backgrounds of CAD
Abstract. In the past, some information technologies (IT) have quickly been adopted by the engineering practice while the implementation of others has been slower. In the paper, th...
Ziga Turk
DALT
2010
Springer
14 years 5 months ago
Executing Specifications of Social Reasoning Agents
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
Iain Wallace, Michael Rovatsos
ATAL
2009
Springer
15 years 4 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson