Sciweavers

7289 search results - page 258 / 1458
» A Dependent Set Theory
Sort
View
CSCLP
2008
Springer
15 years 8 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
ECAI
2006
Springer
15 years 10 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
CORR
2010
Springer
155views Education» more  CORR 2010»
15 years 4 months ago
A Proof Theoretic Analysis of Intruder Theories
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
Alwen Tiu, Rajeev Goré, Jeremy E. Dawson
HASKELL
2009
ACM
16 years 1 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
ECIS
2001
15 years 8 months ago
Barriers to effective knowledge management: Action Research Meets Grounded Theory
Despite evidence that the majority of knowledge management (KM) initiatives miscarry, there has been a paucity of critical, in-depth research into the causes of failure. In this p...
David Graham Wastell