Sciweavers

1055 search results - page 85 / 211
» Enumerations in computable structure theory
Sort
View
IJCINI
2007
110views more  IJCINI 2007»
14 years 9 months ago
Toward Autonomic Computing: Adaptive Neural Network for Trajectory Planning
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
Amar Ramdane-Cherif
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
FOSSACS
2010
Springer
15 years 4 months ago
Parameterised Multiparty Session Types
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
Nobuko Yoshida, Pierre-Malo Deniélou, Andi ...
HICSS
2008
IEEE
129views Biometrics» more  HICSS 2008»
15 years 4 months ago
Understanding Development and Usage of Social Networking Sites: The Social Software Performance Model
Social networking sites such as MySpace and Facebook thrive on energetic social interaction, but the factors that assure this are not well understood. There is a lack of theory th...
Catherine Dwyer, Starr Roxanne Hiltz, George Widme...
LICS
2008
IEEE
15 years 4 months ago
The Quest for a Logic Capturing PTIME
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
Martin Grohe