Sciweavers

906 search results - page 100 / 182
» Linking Theories of Concurrency
Sort
View
LATA
2009
Springer
15 years 4 months ago
Nondeterministic Instance Complexity and Proof Systems with Advice
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
Olaf Beyersdorff, Johannes Köbler, Sebastian ...
IAT
2008
IEEE
15 years 4 months ago
Formalizing Multi-state Learning Dynamics
This paper extends the link between evolutionary game theory and multi-agent reinforcement learning to multistate games. In previous work, we introduced piecewise replicator dynam...
Daniel Hennes, Karl Tuyls, Matthias Rauterberg
HICSS
2007
IEEE
630views Biometrics» more  HICSS 2007»
15 years 4 months ago
The Ability-Motivation-Opportunity Framework for Behavior Research in IS
Some theoretical models used in IS research may lack explanatory power and consistency because of their failure to provide an adequate means of accounting for contextual and situa...
Jerald Hughes
INFOCOM
2007
IEEE
15 years 4 months ago
A Min-Plus System Interpretation of Bandwidth Estimation
— Significant research has been dedicated to methods that estimate the available bandwidth in a network from traffic measurements. While estimation methods abound, less progres...
Jörg Liebeherr, Markus Fidler, Shahrokh Valae...
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
15 years 4 months ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod